A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
From MaRDI portal
Publication:1086177
DOI10.1016/0022-247X(84)90002-7zbMath0607.90089MaRDI QIDQ1086177
Publication date: 1984
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
A general theory of dual optimization problems, Some further relations between unperturbational and perturbational dual optimization problems, Infimal generators and dualities between complete lattices, Surrogate duality for vector optimization, Some characterizations of surrogate dual problems, Optimization by level set methods vi:generalizations of surrogate type reverse convex duality, Quasiconvex duality theory by generalized conjugation methods, Unnamed Item, Some general Lagrangian duality theorems, Best approximation and optimization, Some characterizations of perturbational dual problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Surrogate dual problems and surrogate Lagrangians
- Duality theorems for linear systems and convex systems
- Duality theorems for perturbed convex optimization
- Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems
- Surrogate conjugate functionals and surrogate convexity
- The lower semi-continuous quasi-convex hull as a normalized second conjugate
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- Optimization by level set methods. III: Characterizations of solutions in the presence of duality
- Optimization by level set methods. IV: Generalizations and complements
- On $\Phi $-Convexity in Extremal Problems
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Quasi-Convex Programming
- Surrogate Mathematical Programming
