Duality for nonconvex approximation and optimization.
zbMATH Open1119.90002MaRDI QIDQ2491992FDOQ2491992
Publication date: 31 May 2006
Published in: CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC (Search for Journal in Brave)
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (25)
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Continuity of Optimal Solution Functions and their Conditions on Objective Functions
- ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY
- A duality relation in nonconvex programming
- Relationships Between Farthest Point Problem and Best Approximation Problem
- Best approximation in max-plus semimodules
- Locating a semi-obnoxious facility in the special case of Manhattan distances
- Duality in nonconvex vector optimization
- Title not available (Why is that?)
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-support hyperplanes in asymmetric normed spaces
- An approach for the convex feasibility problem via monotropic programming
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- The distance between two convex sets
- The separation of convex sets and the Krein–Milman theorem in fuzzy quasi-normed space
- Duality for almost convex optimization problems via the perturbation approach
- Title not available (Why is that?)
- New global optimality conditions for nonsmooth DC optimization problems
- Title not available (Why is that?)
- Dual coordinate ascent methods for non-strictly convex minimization
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Duality and Convex Programming
- An extragradient algorithm for solving general nonconvex variational inequalities
This page was built for publication: Duality for nonconvex approximation and optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491992)
