Surrogate duality for vector optimization
DOI10.1080/01630568708816247zbMATH Open0609.49012OpenAlexW2162318179WikidataQ57836432 ScholiaQ57836432MaRDI QIDQ3749657FDOQ3749657
Authors: Juan-Enrique Martínez-Legaz, Ivan Singer 
Publication date: 1987
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568708816247
Recommendations
- Surrogate duality for robust quasiconvex vector optimization
- Surrogate duality for robust optimization
- Conjugate duality in vector optimization
- A new approach to duality in vector optimization
- Duality in Vector Optimization
- The duality on vector optimization problems
- Vector optimization and generalized Lagrangian duality
- Surrogate duality for optimization problems involving set functions
- scientific article; zbMATH DE number 15450
- Sur la dualité en optimisation vectorielle convexe
level setssaddle-point characterizationsurrogate dualitysurrogate Lagrangiansgeneralized half-spacesPareto-minimasurrogate subdifferentialsvector optimization problems with convex constraints
Sensitivity, stability, parametric optimization (90C31) Methods involving semicontinuity and convergence; relaxation (49J45) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Duality theory (optimization) (49N15) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17)
Cites Work
- Exact quasiconvex conjugation
- Surrogate Mathematical Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Quasi-Convex Programming
- Lexicographical characterization of the faces of convex sets
- Lexicographical order and duality in multiobjective programming
- Duality in vector optimization
- Maximal convex sets
- Surrogate dual problems and surrogate Lagrangians
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- Optimization by level set methods. III: Characterizations of solutions in the presence of duality
- Optimization by level set methods. IV: Generalizations and complements
- A duality theory for abstract mathematical programs with applications to optimal control theory
- Saddle points and duality in multi-objective programming
Cited In (6)
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- Title not available (Why is that?)
- Quasiconvex duality theory by generalized conjugation methods
- Compatible preorders and linear operators on \({\mathbb{R}}^ n\)
- Lexicographical order, lexicographical index, and linear operators
- Characterizations of efficient solutions under polyhedrality assumptions
This page was built for publication: Surrogate duality for vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3749657)
