scientific article; zbMATH DE number 5662944

MaRDI QIDQ5852066zbMATH OpenFDO

Authors G. Li, V. Jeyakumar

Publication date 26 January 2010

Full work available at URL http://www.heldermann.de/JCA/JCA16/JCA163/jca16051.htm

zbMATH Keywords

\(\varepsilon \)-subdifferential sum formulaconvex programsFenchel dualitypartially asymptotic Lagrange multiplier conditions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Optimality conditions for free problems in two or more independent variables (49K10) Duality theory (optimization) (49N15)

Recommendations

• Optimality conditions and constraint qualifications for quasiconvex programming
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• Optimality Conditions for Quasiconvex Programs
• Duality theorems for separable convex programming without qualifications
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• A constraint qualification for convex programming
• On sufficient optimality conditions for a quasiconvex programming problem
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming

Cited in

(13)

• Valid inequalities for separable concave constraints with indicator variables
• Global error bounds for piecewise convex polynomials
• Duality theorems for separable convex programming without qualifications
• A qualification free sequential Pshenichnyi-Rockafellar lemma and convex semidefinite
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Robust Farkas' lemma for uncertain linear systems with applications
• Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]
• New strong duality results for convex programs with separable constraints
• A note on nonconvex minimax theorem with separable homogeneous polynomials
• Optimality criteria without constraint qualifications for linear semidefinite problems
• Farkas' lemma for separable sublinear inequalities without qualifications
• Liberating the subgradient optimality conditions from constraint qualifications
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications

This page was built for publication:

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