Subsmooth semi-infinite and infinite optimization problems
From MaRDI portal
Publication:715070
DOI10.1007/S10107-011-0440-8zbMATH Open1259.90141OpenAlexW2141957455MaRDI QIDQ715070FDOQ715070
Authors: Xi Yin Zheng, K. F. Ng 
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0440-8
Recommendations
- 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
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Cites Work
- Subsmooth sets: Functional characterizations and related concepts
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prox-regular functions in variational analysis
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Error bounds in mathematical programming
- Bi-level strategies in semi-infinite programming.
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-infinite programming. Recent advances
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Calmness of constraint systems with applications
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Weak sharp minima revisited. I: Basic theory
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Title not available (Why is that?)
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- A formula for the set of optimal solutions of a relaxed minimization problem. Applications to subdifferential calculus
- Strong uniqueness in sequential linear programming
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Penalty and smoothing methods for convex semi-infinite programming
- Global unicity in semi-infinite optimization
- Global weak sharp minima for convex (semi-)infinite optimization problems
Cited In (18)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Stability of error bounds for conic subsmooth inequalities
- Slater Condition for Tangent Derivatives
- Optimality and duality for robust multiobjective optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Applying convexificators in robust multiobjective optimization
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
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)
