Una caracterización dual de optimalidad para optimización convexa

DOI10.1007/BF02889704zbMath0735.90053MaRDI QIDQ3971487

Jose Manuel Gutierrez Diez

Publication date: 25 June 1992

Published in: Trabajos de Estadistica y de Investigacion Operativa (Search for Journal in Brave)

zbMATH Keywords

convex optimizationsubgradientsnecessary and sufficient dual optimality condition

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)

Related Items (1)

Quasiconvex duality theory by generalized conjugation methods

Cites Work

• Unnamed Item
• Unnamed Item
• Farkas-Minkowski systems in semi-infinite programming
• A simplified test for optimality
• A course on optimization and best approximation
• On the monotonicity of the gradient of a convex function
• Geometry of optimality conditions and constraint qualifications: The convex case
• Characterizations of optimality in convex programming: the nondifferentiable case
• Convex Analysis
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: Una caracterización dual de optimalidad para optimización convexa