Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming

DOI10.1080/02331930802355234zbMath1152.90558OpenAlexW2002743604MaRDI QIDQ5505151

Zhi-You Wu, Dao-Li Zhu, Fu-Sheng Bai

Publication date: 23 January 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930802355234

zbMATH Keywords

convex programming\(\epsilon \)-optimal solutionsequential Lagrange multiplier condition

Mathematics Subject Classification ID

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

Related Items (5)

Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Optimality conditions for composite DC infinite programming problems ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Sequential optimality conditions for multiobjective fractional programming problems

Cites Work

• Liberating the subgradient optimality conditions from constraint qualifications
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• A simple closure condition for the normal cone intersection formula

This page was built for publication: Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming