Duality for optimization and best approximation over finite intersections

DOI10.1080/01630569808816864zbMath0923.46071OpenAlexW1981355037MaRDI QIDQ4221452

Ivan Singer

Publication date: 25 October 1999

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569808816864

zbMATH Keywords

optimizationconvex optimizationbest approximationintersection propertyLagrange dual problemnearest point\(m\)-Lagrangian dualitystrong conical hull

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (5)

Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation ⋮ Fenchel duality in infinite-dimensional setting and its applications. ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Perfect duality theory and complete solutions to a class of global optimization problems*

Cites Work

• A cyclic projection algorithm via duality
• The distance to a polyhedron
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality for optimization and best approximation over finite intersections