Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming

DOI10.1137/19M1303320MaRDI QIDQ5857290

Marco A. López, Pedro Pérez-Aros, Rafael Correa

Publication date: 31 March 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

subdifferentialsemi-infinite programmingFréchet subdifferentialpenalty problemsupremum functionapproximate subdifferentialgeneralized Hessiangeneralized simplex\(\sup\)-stable DC functions\(h\)-controlled functionapproximate active index setapproximate normal setcone-constraint programmingset constraint programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)

Related Items (8)

DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Optimality conditions in DC-constrained mathematical programming problems ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
• A general representation of \(\delta\)-normal sets to sublevels of convex functions
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Semi-infinite programming
• Optimality conditions in DC-constrained optimization
• Formulae for the conjugate and the subdifferential of the supremum function
• Inequality systems and global optimization
• DC programming: overview.
• FORUM about formulae for the conjugate and the subdifferential of the supremum function
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
• Qualification and optimality conditions for dc programs with infinite constraints
• Weaker conditions for subdifferential calculus of convex functions
• Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions
• On difference convexity of locally Lipschitz functions
• A Generalized Second-Order Derivative in Nonsmooth Optimization
• A closedness condition and its applications to DC programs with convex constraints
• Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
• A formula on the approximate subdifferential of the difference of convex functions
• Variational Analysis
• Valadier-like formulas for the supremum function II: The compactly indexed case
• Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
• Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
• Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
• Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
• New Farkas-type constraint qualifications in convex infinite programming
• Convex Analysis
• Convex Analysis and Optimization in the Past 50 Years: Some Snapshots
• Convex analysis and global optimization

This page was built for publication: Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming