Sequential optimality conditions for composed convex optimization problems

DOI10.1016/j.jmaa.2007.12.066zbMath1220.90087OpenAlexW2066424658MaRDI QIDQ2481905

Gert Wanka, Radu Ioan Boţ, Ernö Robert Csetnek

Publication date: 15 April 2008

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.12.066

zbMATH Keywords

perturbation theoryconvex programmingconjugate functionsequential optimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality ⋮ Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications ⋮ Sequential subdifferential for multi-composed functions via perturbation approach ⋮ Unnamed Item ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Characterizations of asymptotic cone of the solution set of a composite convex optimization problem ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Unnamed Item ⋮ Optimality and duality in nonsmooth conic vector optimization ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces

Cites Work

• Liberating the subgradient optimality conditions from constraint qualifications
• Semi-continuous mappings in general topology
• Generalized semicontinuity and existence theorems for cone saddle points
• On strong and total Lagrange duality for convex optimization problems
• Lower semicontinuous regularization for vector-valued mappings
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• On the Subdifferentiability of Convex Functions
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential optimality conditions for composed convex optimization problems