Optimality conditions for composite DC infinite programming problems

DOI10.3934/JIMO.2022064MaRDI QIDQ2691286zbMATH OpenOpenAlexFDO

Authors 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 condition\(\varepsilon\)-subdifferentialglobal optimal solution\(\varepsilon\)-optimal solution

Mathematics Subject Classification ID

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

Recommendations

• Necessary optimality conditions for DC infinite programs with inequality constraints
• A note on optimality conditions for DC programs involving composite functions
• scientific article; zbMATH DE number 7448122
• Local and global optimality conditions for dc infinite optimization problems
• Optimality conditions for convex and DC infinite optimization problems

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 6508514 (Why is no real title available?)
• A closedness condition and its applications to DC programs with convex constraints
• Approximate optimality conditions for composite convex optimization problems
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Fenchel-Lagrange duality for DC infinite programs with inequality constraints
• Generalized Moreau–Rockafellar results for composed convex functions
• Inexact subgradient methods for quasi-convex optimization problems
• Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
• Local and global optimality conditions for dc infinite optimization problems
• Necessary optimality conditions for DC infinite programs with inequality constraints
• On Projection Algorithms for Solving Convex Feasibility Problems
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• Optimality conditions and total dualities for conic programming involving composite function
• Optimality conditions for vector optimization problems with difference of convex maps
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• Some characterizations of duality for DC optimization with composite functions
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• The strong duality for DC optimization problems with composite convex functions
• -optimality conditions for composed convex optimization problems

Cited in

(2)

• A note on optimality conditions for DC programs involving composite functions
• scientific article; zbMATH DE number 7448122 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2691286)