Optimality conditions for composite DC infinite programming problems

DOI10.3934/jimo.2022064OpenAlexW4285209869MaRDI QIDQ2691286

Yanyan Li

Publication date: 29 March 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022064

zbMATH Keywords

optimality conditionglobal optimal solution\(\varepsilon\)-subdifferential\(\varepsilon\)-optimal solution

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
• Optimality conditions for vector optimization problems with difference of convex maps
• Local and global optimality conditions for dc infinite optimization problems
• \(\varepsilon\)-optimality conditions for composed convex optimization problems
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Approximate optimality conditions for composite convex optimization problems
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Inexact subgradient methods for quasi-convex optimization problems
• Fenchel-Lagrange duality for DC infinite programs with inequality constraints
• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Necessary optimality conditions for DC infinite programs with inequality constraints
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
• A closedness condition and its applications to DC programs with convex constraints
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Generalized Moreau–Rockafellar results for composed convex functions
• Some characterizations of duality for DC optimization with composite functions
• On Projection Algorithms for Solving Convex Feasibility Problems
• Optimality conditions and total dualities for conic programming involving composite function
• Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimality conditions for composite DC infinite programming problems