Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming

DOI10.1287/moor.2013.0622zbMath1291.49014OpenAlexW2129048736MaRDI QIDQ5169703

Tran T. A. Nghia, Boris S. Mordukhovich

Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5ce26dae0f8165642ed5a6f512e1cf7750a5e9e5

zbMATH Keywords

semi-infinite programming variational analysis metric regularity constraint qualifications generalized differentiation nonsmooth cone-constrained optimization supremum functions

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)

Related Items (28)

Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory ⋮ Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ Characterizing nonconvex constrained best approximation using Robinson's constraint qualification ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming ⋮ Estimates for coderivative of solution map in bilevel program ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Approximate solutions for robust multiobjective optimization programming in Asplund spaces ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Characterizing best approximation from a convex set without convex representation ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ New extremal principles with applications to stochastic and semi-infinite programming ⋮ Optimality Conditions for Special Semidefinite Bilevel Optimization Problems ⋮ A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions ⋮ Optimality and duality in nonsmooth conic vector optimization ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Unnamed Item ⋮ Optimality conditions for nonconvex problems over nearly convex feasible sets ⋮ Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions ⋮ Full Stability in Finite-Dimensional Optimization ⋮ Variational Analysis in Normed Spaces with Applications to Constrained Optimization ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Bilevel Optimization and Variational Analysis

This page was built for publication: Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming