Sequential Lagrangian conditions for convex programs with applications to semidefinite programming

DOI10.1007/S10957-004-1712-8zbMATH Open1114.90083OpenAlexW2021295607MaRDI QIDQ1781864FDOQ1781864

Authors: Niranjan Chakravarthy 

Publication date: 9 June 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-004-1712-8

Recommendations

• Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
• SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• scientific article; zbMATH DE number 5245384
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Sequential optimality conditions for composed convex optimization problems
• On sequential optimality conditions for smooth constrained optimization
• On sequential optimality conditions for smooth constrained optimization
• A sequential convex program approach to an inverse linear semidefinite programming problem
• scientific article; zbMATH DE number 4070639

zbMATH Keywords

constraint qualificationsdualitysemidefinite programsSequential Lagrangian conditions

Mathematics Subject Classification ID

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

Cites Work

• Characterizations of solution sets of convex vector minimization problems
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Generalizations of Slater's constraint qualification for infinite convex programs
• Perfect duality for convexlike programs
• Inequality systems and global optimization
• Strong Duality for Semidefinite Programming
• Zero duality gaps in infinite-dimensional programming
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
• Results of farkas type
• A note on perfect duality and limiting lagrangeans

Cited In (26)

• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Farkas-type results for vector-valued functions with applications
• Revisiting some rules of convex analysis
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
• Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
• Sequential optimality conditions for composed convex optimization problems
• Farkas' lemma: three decades of generalizations for mathematical optimization
• A qualification free sequential Pshenichnyi-Rockafellar lemma and convex semidefinite
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
• The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• Some convex programs without a duality gap
• Sequential characterization of solutions in convex composite programming and applications to vector optimization
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
• New Farkas-type constraint qualifications in convex infinite programming
• Functional inequalities and theorems of the alternative involving composite functions
• On duality theory for non-convex semidefinite programming
• Title not available (Why is that?)
• Duality and optimality conditions for generalized equilibrium problems involving DC functions
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• A sequential convex program approach to an inverse linear semidefinite programming problem
• SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• A closedness condition and its applications to DC programs with convex constraints
• Stable and total Fenchel duality for composed convex optimization problems
• Title not available (Why is that?)

This page was built for publication: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming

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