Infinite-dimensional convex programming with applications to constrained approximation
From MaRDI portal
Publication:1321276
DOI10.1007/BF00940493zbMath0797.90076MaRDI QIDQ1321276
Publication date: 30 October 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940493
regularity conditions; normed linear spaces; constraint qualifications; constrained interpolation; constrained approximation; infinite-dimensional convex programming
Related Items
Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities, Convex composite multi-objective nonsmooth programming, Characterizations of the solution sets of convex programs and variational inequality problems, The convexity of the solution set of a pseudoconvex inequality, On characterizing the solution sets of pseudoinvex extremum problems, Characterizations of optimal solution sets of convex infinite programs, On characterizing the solution sets of pseudolinear programs, A note on characterizing solution set of nonsmooth pseudoinvex optimization problem, Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems, Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications, On characterizing solution set of non-differentiable η-pseudolinear extremum problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- Constrained interpolation and smoothing
- A simple characterization of solutions sets of convex programs
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Generalizations of Slater's constraint qualification for infinite convex programs
- A practical guide to splines
- Zero duality gaps in infinite-dimensional programming
- Constrained best approximation in Hilbert space
- A course on optimization and best approximation
- Characterization of solution sets of convex programs
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Regularity and Stability for Convex Multivalued Functions
- Duality and infinite dimensional optimization
