Optimality conditions in convex optimization revisited

DOI10.1007/s11590-011-0410-3zbMath1267.90096OpenAlexW2163062359MaRDI QIDQ1940430

Joydeep Dutta, C. S. Lalitha

Publication date: 7 March 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0410-3

zbMATH Keywords

convex optimizationconvex functionsLipschitz functionsKKT conditions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (30)

Necessary and sufficient KKT optimality conditions in non-convex optimization ⋮ Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ New qualification conditions for convex optimization without convex representation ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ Optimality conditions and a barrier method in optimization with convex geometric constraint ⋮ Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ A barrier method in convex vector optimization with generalized inequality constraints ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ Unnamed Item ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Barrier method in nonsmooth convex optimization without convex representation ⋮ Subdifferential of the supremum via compactification of the index set ⋮ Optimality conditions for nonconvex problems over nearly convex feasible sets ⋮ Unnamed Item ⋮ Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials ⋮ Improved recurrent neural network-based manipulator control with remote center of motion constraints: experimental results ⋮ Optimality and duality for vector optimization problem with non-convex feasible set ⋮ Optimality conditions in convex optimization with locally Lipschitz constraints ⋮ Optimality Conditions for Nonconvex Constrained Optimization Problems ⋮ Unnamed Item ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints

Cites Work

• On representations of the feasible set in convex optimization
• Convex analysis and nonlinear optimization. Theory and examples
• Optimization and nonsmooth analysis
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimality conditions in convex optimization revisited