Best approximation and optimization
From MaRDI portal
Publication:801499
DOI10.1016/0021-9045(84)90068-6zbMath0552.41020OpenAlexW2018195051MaRDI QIDQ801499
Publication date: 1984
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(84)90068-6
Cites Work
- Surrogate dual problems and surrogate Lagrangians
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- Connected level sets, minimizing sets and uniqueness in optimization
- Duality theorems for perturbed convex optimization
- Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems
- On upper semicontinuity of global minima in constrained optimization problems
- A sufficient condition for continuity of optimal sets in mathematical programming
- On condition number theorems in mathematical programming
- On the continuity of the minimum set of a continuous function
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- Nonconvex minimization problems
- Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Zur existenz von lösungen konvexer optimierungsaufgaben in lokalkonvexen räumen
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Optimization by level set methods. III: Characterizations of solutions in the presence of duality
- Optimization by level set methods. IV: Generalizations and complements
- Nonconvex Optimization Problems Depending on a Parameter
- STABILITY OF A MINIMIZATION PROBLEM UNDER PERTURBATION OF THE SET OF ADMISSIBLE ELEMENTS
- On $\Phi $-Convexity in Extremal Problems
- Extension with larger norm and separation with double support in normed linear spaces
- On the Subdifferentiability of Convex Functions
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Maximal Separation Theorems for Convex Sets
- Symmetric Mathematical Programs
- Duality in mathematical programming and some problems of convex analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
