Una caracterización dual de optimalidad para optimización convexa
From MaRDI portal
Publication:3971487
Cites work
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3286429 (Why is no real title available?)
- A course on optimization and best approximation
- A simplified test for optimality
- Characterizations of optimality in convex programming: the nondifferentiable case
- Convex Analysis
- Farkas-Minkowski systems in semi-infinite programming
- Geometry of optimality conditions and constraint qualifications: The convex case
- On the monotonicity of the gradient of a convex function
- Sufficient conditions for extremum, penalty functions and regularity
Cited in
(10)- scientific article; zbMATH DE number 1748528 (Why is no real title available?)
- Quasiconvex duality theory by generalized conjugation methods
- New duality results for evenly convex optimization problems
- Duality for almost convex optimization problems via the perturbation approach
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Finding a strict feasible dual solution of a convex optimization problem
- scientific article; zbMATH DE number 1329073 (Why is no real title available?)
- On coderivatives and Lipschitzian properties of the dual pair in optimization
- The characterization of affine maximizers on restricted domains with two alternatives
- scientific article; zbMATH DE number 6500589 (Why is no real title available?)
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)