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

DOI10.1007/BF02889704zbMATH Open0735.90053MaRDI QIDQ3971487FDOQ3971487

Authors: 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)

Cites Work

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

Cited In (10)

• Finding a strict feasible dual solution of a convex optimization problem
• New duality results for evenly convex optimization problems
• The characterization of affine maximizers on restricted domains with two alternatives
• Title not available (Why is that?)
• Quasiconvex duality theory by generalized conjugation methods
• Duality for almost convex optimization problems via the perturbation approach
• On coderivatives and Lipschitzian properties of the dual pair in optimization
• Title not available (Why is that?)
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• Title not available (Why is that?)

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

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