Approximate duality

DOI10.1007/S10957-007-9281-2MaRDI QIDQ2483045zbMATH OpenOpenAlexWikidataFDO

Authors Don R. Hush, Ingo Steinwart, C. Scovel

Publication date 5 May 2008

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-007-9281-2

zbMATH Keywords

support vector machinesLagrangian duality\(\epsilon\)-Kuhn-Tucker conditions\(\epsilon\)-Kuhn-Tucker vectors\(\epsilon\)-minimizers\(\epsilon\)-saddle points

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• scientific article; zbMATH DE number 3951400
• Duality related to approximate proper solutions of vector optimization problems
• Duality for nonconvex approximation and optimization.
• A general theory of dual optimization problems
• Approximate Lagrangian duality and saddle point optimality in set optimization

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 3955816 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• Convex Analysis
• Fast rates for support vector machines using Gaussian kernels
• Necessary Suboptimality and Optimality Conditions via Variational Principles
• Nonlinear Programming in Banach Space
• On the variational principle
• What is the Subdifferential of the Closed Convex Hull of a Function?
• ε-Optimal solutions in nondifferentiable convex programming and some related questions

Cited in

(6)

• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
• Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
• Almost semi-correspondence
• scientific article; zbMATH DE number 7306858 (Why is no real title available?)
• An approach to characterizing \(\epsilon\)-solution sets of convex programs

This page was built for publication: Approximate duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483045)