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

DOI10.1080/02331930802355234zbMATH Open1152.90558OpenAlexW2002743604MaRDI QIDQ5505151FDOQ5505151

Authors: Fusheng Bai, Zhiyou Wu, Daoli Zhu 

Publication date: 23 January 2009

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• scientific article; zbMATH DE number 5245384
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
• Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps

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)

Cites Work

• ε-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
• Liberating the subgradient optimality conditions from constraint qualifications

Cited In (11)

• A note on optimality conditions for DC programs involving composite functions
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• Optimality conditions for composite DC infinite programming problems
• Title not available (Why is that?)
• Sequential optimality conditions for multiobjective fractional programming problems
• Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
• Title not available (Why is that?)
• Sequential optimality conditions for fractional optimization with applications to vector optimization
• Approximate optimality conditions for nonsmooth optimization problems
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

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

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