Approximate duality
From MaRDI portal
Publication:2483045
DOI10.1007/s10957-007-9281-2zbMath1155.90022WikidataQ59196403 ScholiaQ59196403MaRDI QIDQ2483045
Don Hush, Ingo Steinwart, Clint 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
support vector machines; Lagrangian duality; \(\epsilon\)-Kuhn-Tucker conditions; \(\epsilon\)-Kuhn-Tucker vectors; \(\epsilon\)-minimizers; \(\epsilon\)-saddle points
90C25: Convex programming
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Unnamed Item, Unnamed Item, Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems, \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints, An approach to characterizing \(\epsilon\)-solution sets of convex programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast rates for support vector machines using Gaussian kernels
- On the variational principle
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- What is the Subdifferential of the Closed Convex Hull of a Function?
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- Nonlinear Programming in Banach Space
- Convex Analysis
