Perturbation of error bounds

- Kruger, Alexander, López, Marco, Théra, Michel

**Authors:**Kruger, Alexander , López, Marco , Théra, Michel**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 533-554**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**Our aim in the current article is to extend the developments in Kruger et al. (SIAM J Optim 20(6):3280–3296, 2010. doi:10.1137/100782206) and, more precisely, to characterize, in the Banach space setting, the stability of the local and global error bound property of inequalities determined by lower semicontinuous functions under data perturbations. We propose new concepts of (arbitrary, convex and linear) perturbations of the given function defining the system under consideration, which turn out to be a useful tool in our analysis. The characterizations of error bounds for families of perturbations can be interpreted as estimates of the ‘radius of error bounds’. The definitions and characterizations are illustrated by examples. © 2017, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

**Authors:**Kruger, Alexander , López, Marco , Théra, Michel**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 533-554**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**Our aim in the current article is to extend the developments in Kruger et al. (SIAM J Optim 20(6):3280–3296, 2010. doi:10.1137/100782206) and, more precisely, to characterize, in the Banach space setting, the stability of the local and global error bound property of inequalities determined by lower semicontinuous functions under data perturbations. We propose new concepts of (arbitrary, convex and linear) perturbations of the given function defining the system under consideration, which turn out to be a useful tool in our analysis. The characterizations of error bounds for families of perturbations can be interpreted as estimates of the ‘radius of error bounds’. The definitions and characterizations are illustrated by examples. © 2017, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

Set regularities and feasibility problems

- Kruger, Alexander, Luke, Russell, Thao, Nguyen

**Authors:**Kruger, Alexander , Luke, Russell , Thao, Nguyen**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 279-311**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms

**Authors:**Kruger, Alexander , Luke, Russell , Thao, Nguyen**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 279-311**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms

A comparison of bidding strategies for online auctions using fuzzy reasoning and negotiation decision functions

- Kaur, Preetinder, Goyal, Madhu, Lu, Jie

**Authors:**Kaur, Preetinder , Goyal, Madhu , Lu, Jie**Date:**2017**Type:**Text , Journal article**Relation:**IEEE Transactions on Fuzzy Systems Vol. 25, no. 2 (2017), p. 425-438**Full Text:****Reviewed:****Description:**Bidders often feel challenged when looking for the best bidding strategies to excel in the competitive environment of multiple and simultaneous online auctions for same or similar items. Bidders face complicated issues for deciding which auction to participate in, whether to bid early or late, and how much to bid. In this paper, we present the design of bidding strategies, which aim to forecast the bid amounts for buyers at a particular moment in time based on their bidding behavior and their valuation of an auctioned item. The agent develops a comprehensive methodology for final price estimation, which designs bidding strategies to address buyers' different bidding behaviors using two approaches: Mamdani method with regression analysis and negotiation decision functions. The experimental results show that the agents who follow fuzzy reasoning with a regression approach outperform other existing agents in most settings in terms of their success rate and expected utility.

**Authors:**Kaur, Preetinder , Goyal, Madhu , Lu, Jie**Date:**2017**Type:**Text , Journal article**Relation:**IEEE Transactions on Fuzzy Systems Vol. 25, no. 2 (2017), p. 425-438**Full Text:****Reviewed:****Description:**Bidders often feel challenged when looking for the best bidding strategies to excel in the competitive environment of multiple and simultaneous online auctions for same or similar items. Bidders face complicated issues for deciding which auction to participate in, whether to bid early or late, and how much to bid. In this paper, we present the design of bidding strategies, which aim to forecast the bid amounts for buyers at a particular moment in time based on their bidding behavior and their valuation of an auctioned item. The agent develops a comprehensive methodology for final price estimation, which designs bidding strategies to address buyers' different bidding behaviors using two approaches: Mamdani method with regression analysis and negotiation decision functions. The experimental results show that the agents who follow fuzzy reasoning with a regression approach outperform other existing agents in most settings in terms of their success rate and expected utility.

Borwein–Preiss vector variational principle

- Kruger, Alexander, Plubtieng, Somyot, Seangwattana, Thidaporn

**Authors:**Kruger, Alexander , Plubtieng, Somyot , Seangwattana, Thidaporn**Date:**2017**Type:**Text , Journal article**Relation:**Positivity Vol. 21, no. 4 (2017), p. 1273-1292**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This article extends to the vector setting the results of our previous work Kruger et al. (J Math Anal Appl 435(2):1183–1193, 2016) which refined and slightly strengthened the metric space version of the Borwein–Preiss variational principle due to Li and Shi (J Math Anal Appl 246(1):308–319, 2000. doi:10.1006/jmaa.2000.6813). We introduce and characterize two seemingly new natural concepts of ε-minimality, one of them dependent on the chosen element in the ordering cone and the fixed “gauge-type” function. © 2017, Springer International Publishing.

**Authors:**Kruger, Alexander , Plubtieng, Somyot , Seangwattana, Thidaporn**Date:**2017**Type:**Text , Journal article**Relation:**Positivity Vol. 21, no. 4 (2017), p. 1273-1292**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This article extends to the vector setting the results of our previous work Kruger et al. (J Math Anal Appl 435(2):1183–1193, 2016) which refined and slightly strengthened the metric space version of the Borwein–Preiss variational principle due to Li and Shi (J Math Anal Appl 246(1):308–319, 2000. doi:10.1006/jmaa.2000.6813). We introduce and characterize two seemingly new natural concepts of ε-minimality, one of them dependent on the chosen element in the ordering cone and the fixed “gauge-type” function. © 2017, Springer International Publishing.

Density character of subgroups of topological groups

- Leiderman, Arkady, Morris, Sidney, Tkachenko, Mikhail

**Authors:**Leiderman, Arkady , Morris, Sidney , Tkachenko, Mikhail**Date:**2017**Type:**Text , Journal article**Relation:**Transactions of the American Mathematical Society Vol. 369, no. 8 (2017), p. 5645-5664**Full Text:****Reviewed:****Description:**We give a complete characterization of subgroups of separable topological groups. Then we show that the following conditions are equivalent for an omega-narrow topological group G: (i) G is homeomorphic to a subspace of a separable regular space; (ii) G is topologically isomorphic to a subgroup of a separable topological group; (iii) G is topologically isomorphic to a closed subgroup of a separable path-connected, locally path-connected topological group. A pro-Lie group is a projective limit of finite-dimensional Lie groups. We prove here that an almost connected pro-Lie group is separable if and only if its weight is not greater than the cardinality c of the continuum. It is deduced from this that an almost connected pro-Lie group is separable if and only if it is homeomorphic to a subspace of a separable Hausdorff space. It is also proved that a locally compact (even feathered) topological group G which is a subgroup of a separable Hausdorff topological group is separable, but the conclusion is false if it is assumed only that G is homeomorphic to a subspace of a separable Tychonoff space. We show that every precompact (abelian) topological group of weight less than or equal to c is topologically isomorphic to a closed subgroup of a separable pseudocompact (abelian) group of weight c. This result implies that there is a wealth of closed non-separable subgroups of separable pseudocompact groups. An example is also presented under the Continuum Hypothesis of a separable countably compact abelian group which contains a non-separable closed subgroup.

**Authors:**Leiderman, Arkady , Morris, Sidney , Tkachenko, Mikhail**Date:**2017**Type:**Text , Journal article**Relation:**Transactions of the American Mathematical Society Vol. 369, no. 8 (2017), p. 5645-5664**Full Text:****Reviewed:****Description:**We give a complete characterization of subgroups of separable topological groups. Then we show that the following conditions are equivalent for an omega-narrow topological group G: (i) G is homeomorphic to a subspace of a separable regular space; (ii) G is topologically isomorphic to a subgroup of a separable topological group; (iii) G is topologically isomorphic to a closed subgroup of a separable path-connected, locally path-connected topological group. A pro-Lie group is a projective limit of finite-dimensional Lie groups. We prove here that an almost connected pro-Lie group is separable if and only if its weight is not greater than the cardinality c of the continuum. It is deduced from this that an almost connected pro-Lie group is separable if and only if it is homeomorphic to a subspace of a separable Hausdorff space. It is also proved that a locally compact (even feathered) topological group G which is a subgroup of a separable Hausdorff topological group is separable, but the conclusion is false if it is assumed only that G is homeomorphic to a subspace of a separable Tychonoff space. We show that every precompact (abelian) topological group of weight less than or equal to c is topologically isomorphic to a closed subgroup of a separable pseudocompact (abelian) group of weight c. This result implies that there is a wealth of closed non-separable subgroups of separable pseudocompact groups. An example is also presented under the Continuum Hypothesis of a separable countably compact abelian group which contains a non-separable closed subgroup.

On the Aubin property of a class of parameterized variational systems

- Gfrerer, Helmut, Outrata, Jiri

**Authors:**Gfrerer, Helmut , Outrata, Jiri**Date:**2017**Type:**Text , Journal article**Relation:**Mathematical Methods of Operations Research Vol. 86, no. 3 (2017), p. 443-467**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**The paper deals with a new sharp condition ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class encompasses various types of parameterized variational inequalities/generalized equations with fairly general constraint sets. The new condition requires computation of directional limiting coderivatives of the normal-cone mapping for the so-called critical directions. The respective formulas have the form of a second-order chain rule and extend the available calculus of directional limiting objects. The suggested procedure is illustrated by means of examples. © 2017, Springer-Verlag GmbH Germany.

**Authors:**Gfrerer, Helmut , Outrata, Jiri**Date:**2017**Type:**Text , Journal article**Relation:**Mathematical Methods of Operations Research Vol. 86, no. 3 (2017), p. 443-467**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**The paper deals with a new sharp condition ensuring the Aubin property of solution maps to a class of parameterized variational systems. This class encompasses various types of parameterized variational inequalities/generalized equations with fairly general constraint sets. The new condition requires computation of directional limiting coderivatives of the normal-cone mapping for the so-called critical directions. The respective formulas have the form of a second-order chain rule and extend the available calculus of directional limiting objects. The suggested procedure is illustrated by means of examples. © 2017, Springer-Verlag GmbH Germany.

On the convexity of nonlinear elastic energies in the right Cauchy-Green tensor

- Gao, David, Neff, Patrizio, Roventa, Ionel, Thiel, Christian

**Authors:**Gao, David , Neff, Patrizio , Roventa, Ionel , Thiel, Christian**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Elasticity Vol. 127, no. 2 (2017), p. 303-308**Full Text:****Reviewed:****Description:**We present a sufficient condition under which a weak solution of the Euler-Lagrange equations in nonlinear elasticity is already a global minimizer of the corresponding elastic energy functional. This criterion is applicable to energies which are convex with respect to the right Cauchy-Green tensor , where denotes the gradient of deformation. Examples of such energies exhibiting a blow up for are given.

**Authors:**Gao, David , Neff, Patrizio , Roventa, Ionel , Thiel, Christian**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Elasticity Vol. 127, no. 2 (2017), p. 303-308**Full Text:****Reviewed:****Description:**We present a sufficient condition under which a weak solution of the Euler-Lagrange equations in nonlinear elasticity is already a global minimizer of the corresponding elastic energy functional. This criterion is applicable to energies which are convex with respect to the right Cauchy-Green tensor , where denotes the gradient of deformation. Examples of such energies exhibiting a blow up for are given.

A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case

- Kasimbeyli, Nergiz, Kasimbeyli, Refail, Mammadov, Musa

**Authors:**Kasimbeyli, Nergiz , Kasimbeyli, Refail , Mammadov, Musa**Date:**2016**Type:**Text , Journal article**Relation:**Optimization Vol. 65, no. 5 (May 2016), p. 937-945**Full Text:****Reviewed:****Description:**The paper presents a generalization of a known density theorem of Arrow, Barankin, and Blackwell for properly efficient points defined as support points of sets with respect to monotonically increasing sublinear functions. This result is shown to hold for nonconvex sets of a partially ordered reflexive Banach space.

**Authors:**Kasimbeyli, Nergiz , Kasimbeyli, Refail , Mammadov, Musa**Date:**2016**Type:**Text , Journal article**Relation:**Optimization Vol. 65, no. 5 (May 2016), p. 937-945**Full Text:****Reviewed:****Description:**The paper presents a generalization of a known density theorem of Arrow, Barankin, and Blackwell for properly efficient points defined as support points of sets with respect to monotonically increasing sublinear functions. This result is shown to hold for nonconvex sets of a partially ordered reflexive Banach space.

Analytical solutions to general anti-plane shear problems in finite elasticity

**Authors:**Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**Continuum Mechanics and Thermodynamics Vol. 28, no. 1-2 (2016), p. 175-194**Full Text:****Reviewed:****Description:**This paper presents a pure complementary energy variational method for solving a general anti-plane shear problem in finite elasticity. Based on the canonical dualityâ€“triality theory developed by the author, the nonlinear/nonconvex partial differential equations for the large deformation problem are converted into an algebraic equation in dual space, which can, in principle, be solved to obtain a complete set of stress solutions. Therefore, a general analytical solution form of the deformation is obtained subjected to a compatibility condition. Applications are illustrated by examples with both convex and nonconvex stored strain energies governed by quadratic-exponential and power-law material models, respectively. Results show that the nonconvex variational problem could have multiple solutions at each material point, the complementary gap function and the triality theory can be used to identify both global and local extremal solutions, while the popular convexity conditions (including rank-one condition) provide mainly local minimal criteria and the Legendre-Hadamard condition (i.e., the so-called strong ellipticity condition) does not guarantee uniqueness of solutions. This paper demonstrates again that the pure complementary energy principle and the triality theory play important roles in finite deformation theory and nonconvex analysis. © 2015, Springer-Verlag Berlin Heidelberg.

**Authors:**Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**Continuum Mechanics and Thermodynamics Vol. 28, no. 1-2 (2016), p. 175-194**Full Text:****Reviewed:****Description:**This paper presents a pure complementary energy variational method for solving a general anti-plane shear problem in finite elasticity. Based on the canonical dualityâ€“triality theory developed by the author, the nonlinear/nonconvex partial differential equations for the large deformation problem are converted into an algebraic equation in dual space, which can, in principle, be solved to obtain a complete set of stress solutions. Therefore, a general analytical solution form of the deformation is obtained subjected to a compatibility condition. Applications are illustrated by examples with both convex and nonconvex stored strain energies governed by quadratic-exponential and power-law material models, respectively. Results show that the nonconvex variational problem could have multiple solutions at each material point, the complementary gap function and the triality theory can be used to identify both global and local extremal solutions, while the popular convexity conditions (including rank-one condition) provide mainly local minimal criteria and the Legendre-Hadamard condition (i.e., the so-called strong ellipticity condition) does not guarantee uniqueness of solutions. This paper demonstrates again that the pure complementary energy principle and the triality theory play important roles in finite deformation theory and nonconvex analysis. © 2015, Springer-Verlag Berlin Heidelberg.

Borwein-Preiss variational principle revisited

- Kruger, Alexander, Plubtieng, Somyot, Seangwattana, Thidaporn

**Authors:**Kruger, Alexander , Plubtieng, Somyot , Seangwattana, Thidaporn**Date:**2016**Type:**Text , Journal article**Relation:**Journal of Mathematical Analysis and Applications Vol. 435, no. 2 (2016), p. 1183-1193**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**In this article, we refine and slightly strengthen the metric space version of the Borwein-Preiss variational principle due to Li and Shi (2000) [12], clarify the assumptions and conclusions of their Theorem 1 as well as Theorem 2.5.2 in Borwein and Zhu (2005) [4] and streamline the proofs. Our main result, Theorem 3 is formulated in the metric space setting. When reduced to Banach spaces (Corollary 9), it extends and strengthens the smooth variational principle established in Borwein and Preiss (1987) [3] along several directions. (C) 2015 Elsevier Inc. All rights reserved.

**Authors:**Kruger, Alexander , Plubtieng, Somyot , Seangwattana, Thidaporn**Date:**2016**Type:**Text , Journal article**Relation:**Journal of Mathematical Analysis and Applications Vol. 435, no. 2 (2016), p. 1183-1193**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**In this article, we refine and slightly strengthen the metric space version of the Borwein-Preiss variational principle due to Li and Shi (2000) [12], clarify the assumptions and conclusions of their Theorem 1 as well as Theorem 2.5.2 in Borwein and Zhu (2005) [4] and streamline the proofs. Our main result, Theorem 3 is formulated in the metric space setting. When reduced to Banach spaces (Corollary 9), it extends and strengthens the smooth variational principle established in Borwein and Preiss (1987) [3] along several directions. (C) 2015 Elsevier Inc. All rights reserved.

Comparative analysis of numerical solution of optimal control problems

- Shangareeva, Gulnaz, Grigoryev, Igor, Mustafina, Svetlana

**Authors:**Shangareeva, Gulnaz , Grigoryev, Igor , Mustafina, Svetlana**Date:**2016**Type:**Text , Journal article**Relation:**International Journal of Pure and Applied Mathematics Vol. 110, no. 4 (2016), p. 645-649**Full Text:****Reviewed:****Description:**In this article step by step algorithms were developed for solving optimal control problems based on the method of successive approximations and the method of variations in the space of controls. The algorithm of the method of successive approximations requires details of the problem to the boundary problem of the maximum principle. In turn, the algorithm of the variations is more versatile because it is based on iterating state variables and control in the phase space. A numerical study and comparative analysis of the developed algorithms performed at different values of accuracy. © 2016 Academic Publications, Ltd.

**Authors:**Shangareeva, Gulnaz , Grigoryev, Igor , Mustafina, Svetlana**Date:**2016**Type:**Text , Journal article**Relation:**International Journal of Pure and Applied Mathematics Vol. 110, no. 4 (2016), p. 645-649**Full Text:****Reviewed:****Description:**In this article step by step algorithms were developed for solving optimal control problems based on the method of successive approximations and the method of variations in the space of controls. The algorithm of the method of successive approximations requires details of the problem to the boundary problem of the maximum principle. In turn, the algorithm of the variations is more versatile because it is based on iterating state variables and control in the phase space. A numerical study and comparative analysis of the developed algorithms performed at different values of accuracy. © 2016 Academic Publications, Ltd.

Global optimal trajectory in Chaos and NP-Hardness

- Latorre, Vittorio, Gao, David

**Authors:**Latorre, Vittorio , Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**International Journal of Bifurcation and Chaos Vol. 26, no. 8 (2016), p. 1-14**Full Text:****Reviewed:****Description:**This paper presents an unconventional theory and method for solving general nonlinear dynamical systems. Instead of the direct iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. A newly developed canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by linear iterative methods are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems. The method and results presented in this paper should bring some new insights into nonlinear dynamical systems and NP-hardness in computational complexity theory. © 2016 World Scientific Publishing Company.

**Authors:**Latorre, Vittorio , Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**International Journal of Bifurcation and Chaos Vol. 26, no. 8 (2016), p. 1-14**Full Text:****Reviewed:****Description:**This paper presents an unconventional theory and method for solving general nonlinear dynamical systems. Instead of the direct iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. A newly developed canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by linear iterative methods are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems. The method and results presented in this paper should bring some new insights into nonlinear dynamical systems and NP-hardness in computational complexity theory. © 2016 World Scientific Publishing Company.

Global solutions to a class of CEC benchmark constrained optimization problems

- Zhou, Xiaojun, Gao, David, Yang, Chunhua

**Authors:**Zhou, Xiaojun , Gao, David , Yang, Chunhua**Date:**2016**Type:**Text , Journal article**Relation:**Optimization Letters Vol. 10, no. 3 (2016), p. 457-472**Full Text:****Reviewed:****Description:**This paper aims to solve a class of CEC benchmark constrained optimization problems that have been widely studied by nature-inspired optimization algorithms. Based on canonical duality theory, these challenging problems can be reformulated as a unified canonical dual problem over a convex set, which can be solved deterministically to obtain global optimal solutions in polynomial time. Applications are illustrated by some well-known CEC benchmark problems, and comparisons with other methods have demonstrated the effectiveness of the proposed approach. © 2014, Springer-Verlag Berlin Heidelberg.

**Authors:**Zhou, Xiaojun , Gao, David , Yang, Chunhua**Date:**2016**Type:**Text , Journal article**Relation:**Optimization Letters Vol. 10, no. 3 (2016), p. 457-472**Full Text:****Reviewed:****Description:**This paper aims to solve a class of CEC benchmark constrained optimization problems that have been widely studied by nature-inspired optimization algorithms. Based on canonical duality theory, these challenging problems can be reformulated as a unified canonical dual problem over a convex set, which can be solved deterministically to obtain global optimal solutions in polynomial time. Applications are illustrated by some well-known CEC benchmark problems, and comparisons with other methods have demonstrated the effectiveness of the proposed approach. © 2014, Springer-Verlag Berlin Heidelberg.

Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions

**Authors:**Chen, Yi , Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**Journal of Global Optimization Vol. 64, no. 3 (2016), p. 417-431**Full Text:****Reviewed:****Description:**This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of 4th-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based on the canonical dualityâ€“triality theory, this nonconvex problem is transformed to an equivalent dual problem, which can be solved easily under certain conditions. We proved that both global minimizer and the biggest local extrema of the primal problem can be obtained analytically from the canonical dual solutions. As two special cases, a quartic polynomial minimization and a minimax problem are discussed. Existence conditions are derived, which can be used to classify easy and relative hard instances. Applications are illustrated by several nonconvex and nonsmooth examples. © 2014, Springer Science+Business Media New York.

**Authors:**Chen, Yi , Gao, David**Date:**2016**Type:**Text , Journal article**Relation:**Journal of Global Optimization Vol. 64, no. 3 (2016), p. 417-431**Full Text:****Reviewed:****Description:**This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of 4th-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based on the canonical dualityâ€“triality theory, this nonconvex problem is transformed to an equivalent dual problem, which can be solved easily under certain conditions. We proved that both global minimizer and the biggest local extrema of the primal problem can be obtained analytically from the canonical dual solutions. As two special cases, a quartic polynomial minimization and a minimax problem are discussed. Existence conditions are derived, which can be used to classify easy and relative hard instances. Applications are illustrated by several nonconvex and nonsmooth examples. © 2014, Springer Science+Business Media New York.

On lipschitzian properties of implicit multifunctions

- Gfrerer, Helmut, Outrata, Jiri

**Authors:**Gfrerer, Helmut , Outrata, Jiri**Date:**2016**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 26, no. 4 (2016), p. 2160-2189**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper is devoted to the development of new sufficient conditions for the calmness and the Aubin property of implicit multifunctions. As the basic tool we employ the directional limiting coderivative which, together with the graphical derivative, enables a fine analysis of the local behavior of the investigated multifunction along relevant directions. For verification of the calmness property, in addition, a new condition has been discovered which parallels the missing implicit function paradigm and permits us to replace the original multifunction by a substantially simpler one. Moreover, as an auxiliary tool, a handy formula for the computation of the directional limiting coderivative of the normal-cone map with a polyhedral set has been derived which perfectly matches the framework of [A. L. Dontchev and R. T. Rockafellar, SIAM J. Optim., 6 (1996), pp. 1087{1105]. All important statements are illustrated by examples. © 2016 Society for Industrial and Applied Mathematics.

**Authors:**Gfrerer, Helmut , Outrata, Jiri**Date:**2016**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 26, no. 4 (2016), p. 2160-2189**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper is devoted to the development of new sufficient conditions for the calmness and the Aubin property of implicit multifunctions. As the basic tool we employ the directional limiting coderivative which, together with the graphical derivative, enables a fine analysis of the local behavior of the investigated multifunction along relevant directions. For verification of the calmness property, in addition, a new condition has been discovered which parallels the missing implicit function paradigm and permits us to replace the original multifunction by a substantially simpler one. Moreover, as an auxiliary tool, a handy formula for the computation of the directional limiting coderivative of the normal-cone map with a polyhedral set has been derived which perfectly matches the framework of [A. L. Dontchev and R. T. Rockafellar, SIAM J. Optim., 6 (1996), pp. 1087{1105]. All important statements are illustrated by examples. © 2016 Society for Industrial and Applied Mathematics.

Towards supremum-sum subdifferential calculus free of qualification conditions

- Correa, Rafael, Hantoute, Abderrahim, Lopez, Marco

**Authors:**Correa, Rafael , Hantoute, Abderrahim , Lopez, Marco**Date:**2016**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 26, no. 4 (2016), p. 2219-2234**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We give a formula for the subdifferential of the sum of two convex functions where one of them is the supremum of an arbitrary family of convex functions. This is carried out under a weak assumption expressing a natural relationship between the lower semicontinuous envelopes of the data functions in the domain of the sum function. We also provide a new rule for the subdifferential of the sum of two convex functions, which uses a strategy of augmenting the involved functions. The main feature of our analysis is that no continuity-type condition is required. Our approach allows us to unify, recover, and extend different results in the recent literature.

**Authors:**Correa, Rafael , Hantoute, Abderrahim , Lopez, Marco**Date:**2016**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 26, no. 4 (2016), p. 2219-2234**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We give a formula for the subdifferential of the sum of two convex functions where one of them is the supremum of an arbitrary family of convex functions. This is carried out under a weak assumption expressing a natural relationship between the lower semicontinuous envelopes of the data functions in the domain of the sum function. We also provide a new rule for the subdifferential of the sum of two convex functions, which uses a strategy of augmenting the involved functions. The main feature of our analysis is that no continuity-type condition is required. Our approach allows us to unify, recover, and extend different results in the recent literature.

An induction theorem and nonlinear regularity models

- Khanh, Phan, Kruger, Alexander, Thao, Nguyen

**Authors:**Khanh, Phan , Kruger, Alexander , Thao, Nguyen**Date:**2015**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 25, no. 4 (2015), p. 2561-2588**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**A general nonlinear regularity model for a set-valued mapping F : X x R+ paired right arrows Y, where X and Y are metric spaces, is studied using special iteration procedures, going back to Banach, Schauder, Lyusternik, and Graves. Namely, we revise the induction theorem from Khanh [J. Math. Anal. Appl., 118 (1986), pp. 519-534] and employ it to obtain basic estimates for exploring regularity/openness properties. We also show that it can serve as a substitution for the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping F : X paired right arrows Y. An application to second-order necessary optimality conditions for a nonsmooth set-valued optimization problem with mixed constraints is provided.

**Authors:**Khanh, Phan , Kruger, Alexander , Thao, Nguyen**Date:**2015**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 25, no. 4 (2015), p. 2561-2588**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**A general nonlinear regularity model for a set-valued mapping F : X x R+ paired right arrows Y, where X and Y are metric spaces, is studied using special iteration procedures, going back to Banach, Schauder, Lyusternik, and Graves. Namely, we revise the induction theorem from Khanh [J. Math. Anal. Appl., 118 (1986), pp. 519-534] and employ it to obtain basic estimates for exploring regularity/openness properties. We also show that it can serve as a substitution for the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping F : X paired right arrows Y. An application to second-order necessary optimality conditions for a nonsmooth set-valued optimization problem with mixed constraints is provided.

Canonical duality theory and triality for solving general global optimization problems in complex systems

- Morales-Silva, Daniel, Gao, David

**Authors:**Morales-Silva, Daniel , Gao, David**Date:**2015**Type:**Text , Journal article**Relation:**Mathematics and Mechanics of Complex Systems Vol. 3, no. 2 (2015), p. 139-161**Full Text:****Reviewed:****Description:**General nonconvex optimization problems are studied by using the canonical duality-triality theory. The triality theory is proved for sums of exponentials and quartic polynomials, which solved an open problem left in 2003. This theory can be used to find the global minimum and local extrema, which bridges a gap between global optimization and nonconvex mechanics. Detailed applications are illustrated by several examples. © 2015 Mathematical Sciences Publishers.

**Authors:**Morales-Silva, Daniel , Gao, David**Date:**2015**Type:**Text , Journal article**Relation:**Mathematics and Mechanics of Complex Systems Vol. 3, no. 2 (2015), p. 139-161**Full Text:****Reviewed:****Description:**General nonconvex optimization problems are studied by using the canonical duality-triality theory. The triality theory is proved for sums of exponentials and quartic polynomials, which solved an open problem left in 2003. This theory can be used to find the global minimum and local extrema, which bridges a gap between global optimization and nonconvex mechanics. Detailed applications are illustrated by several examples. © 2015 Mathematical Sciences Publishers.

Directional metric regularity of multifunctions

- Ngai, Huynh Van, Thera, Michel

**Authors:**Ngai, Huynh Van , Thera, Michel**Date:**2015**Type:**Text , Journal article**Relation:**Mathematics of Operations Research Vol. 40, no. 4 (2015), p. 969-991**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**In this paper, we study relative metric regularity of set-valued mappings with emphasis on directional metric regularity. We establish characterizations of relative metric regularity without assuming the completeness of the image spaces, by using the relative lower semicontinuous envelopes of the distance functions to set-valued mappings. We then apply these characterizations to establish a coderivative type criterion for directional metric regularity as well as for the robustness of metric regularity.**Description:**In this paper, we study relative metric regularity of set-valued mappings with emphasis on directional metric regularity. We establish characterizations of relative metric regularity without assuming the completeness of the image spaces, by using the relative lower semicontinuous envelopes of the distance functions to set-valued mappings. We then apply these characterizations to establish a coderivative type criterion for directional metric regularity as well as for the robustness of metric regularity. © 2015 INFORMS.

**Authors:**Ngai, Huynh Van , Thera, Michel**Date:**2015**Type:**Text , Journal article**Relation:**Mathematics of Operations Research Vol. 40, no. 4 (2015), p. 969-991**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**In this paper, we study relative metric regularity of set-valued mappings with emphasis on directional metric regularity. We establish characterizations of relative metric regularity without assuming the completeness of the image spaces, by using the relative lower semicontinuous envelopes of the distance functions to set-valued mappings. We then apply these characterizations to establish a coderivative type criterion for directional metric regularity as well as for the robustness of metric regularity.**Description:**In this paper, we study relative metric regularity of set-valued mappings with emphasis on directional metric regularity. We establish characterizations of relative metric regularity without assuming the completeness of the image spaces, by using the relative lower semicontinuous envelopes of the distance functions to set-valued mappings. We then apply these characterizations to establish a coderivative type criterion for directional metric regularity as well as for the robustness of metric regularity. © 2015 INFORMS.

Error bounds and metric subregularity

**Authors:**Kruger, Alexander**Date:**2015**Type:**Text , Journal article**Relation:**Optimization Vol. 64, no. 1 (2015), p. 49-79**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**Necessary and sufficient criteria for metric subregularity (or calmness) of set-valued mappings between general metric or Banach spaces are treated in the framework of the theory of error bounds for a special family of extended real-valued functions of two variables. A classification scheme for the general error bound and metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.

**Authors:**Kruger, Alexander**Date:**2015**Type:**Text , Journal article**Relation:**Optimization Vol. 64, no. 1 (2015), p. 49-79**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**Necessary and sufficient criteria for metric subregularity (or calmness) of set-valued mappings between general metric or Banach spaces are treated in the framework of the theory of error bounds for a special family of extended real-valued functions of two variables. A classification scheme for the general error bound and metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.