Subsmooth semi-infinite and infinite optimization problems
The article of Xi Yin Zheng and Kung Fu Ng is a very valuable contribution to the field of nonlinear and continuous optimization with a great promise for generalized frameworks of the usual constrained programs by allowing (i) an infinite number of inequality constraints to be given, or, including the objective function now also, (ii) to be defined over an infinite dimensional space. Those optimization problems are called (i) semi-infinite and (ii) infinite, respectively. They play an increasing role in the representation, treatment and solution of problems from (i) approximation of real-world phenomena, e.g. through Chebychev approximation, in design, manufacturing, robotics, computational biology, etc., and (ii) calculus of variations and data mining, etc., respectively. Both (i) and (ii) are useful in optimal control and, e.g. via the new ``infinite kernel learning in machine learning. On the other hand, the article also contributes to nonsmooth optimization; in fact, it lies in the definition of problems from (i) and (ii), that max- or sup-type functions occur, which are nonsmooth usually. Of course, such nonsmooth functions are still rather well-structured and -behaving ones, compared with even more general nonsmooth functions. In fact, the authors apply the concept of subsmoothness (introduced for sets and function families as well) to rigorously represent and study the problems from (i) and (ii). This study is done in a wide functional-analytic setting and with great rigor. Here, a particular interest of the authors exists in strong isolated and strong unique local minimizers; they use the notion of a sharp minimum in their related investigations. First, the authors consider subsmoothness for a function family and present formulas of the subdifferential of the pointwise supremum of a such a family. Then, they consider subsmooth infinite and semi-infinite optimization problems. Especially, they are able to state several dual and primal characterizations for a point to be a sharp minimum of a weak sharp minimum for such optimization problems. The five sections of the article are as follows: 1. Introduction, 2. Preliminaries, 3. Subsmoothness for a function family, 4. Subsmooth infinite optimization problem, and 5. Subsmooth semi-infinite optimization problem. Further deep results and also methods may be expected in the future, initiated and fostered by this research paper. Such advances could then support and stimulate additional advances in science, especially, in data mining and statistics, in engineering, economics and social-political decision making, in finance and OR, in healthcare and medicine, and, herewith, to improvements in the living conditions of the peoples on earth.
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- A formula for the set of optimal solutions of a relaxed minimization problem. Applications to subdifferential calculus
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Bi-level strategies in semi-infinite programming.
- Calmness of constraint systems with applications
- Error bounds in mathematical programming
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Global unicity in semi-infinite optimization
- Global weak sharp minima for convex (semi-)infinite optimization problems
- scientific article; zbMATH DE number 1186920 (Why is no real title available?)
- scientific article; zbMATH DE number 3791103 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Optimization and nonsmooth analysis
- Penalty and smoothing methods for convex semi-infinite programming
- Prox-regular functions in variational analysis
- Semi-infinite programming. Recent advances
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness in sequential linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subsmooth sets: Functional characterizations and related concepts
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Weak Sharp Minima in Mathematical Programming
- Weak sharp minima revisited. I: Basic theory
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- scientific article; zbMATH DE number 4108541 (Why is no real title available?)
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Stability of error bounds for conic subsmooth inequalities
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Slater Condition for Tangent Derivatives
- Optimality and duality for robust multiobjective optimization problems
- Applying convexificators in robust multiobjective optimization
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Necessary optimality conditions for strictly robust bilevel optimization problems
- Optimality conditions and duality in nonsmooth adjustable robust optimization problems
This page was built for publication: Subsmooth semi-infinite and infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715070)
