Beyond canonical dc-optimization: the single reverse polar problem
DOI10.1007/S10957-012-0069-7zbMATH Open1257.90076OpenAlexW2127140420WikidataQ118165460 ScholiaQ118165460MaRDI QIDQ1935286FDOQ1935286
Authors: Giancarlo Bigi, Antonio Frangioni, Qing-Hua Zhang 
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/188948
Recommendations
- Optimality conditions for DC programming problems with reverse convex constraints
- Canonical DC programming problem: Outer approximation methods revisited
- A revision of the rectangular algorithm for a class of DC optimization problems
- On d.c. optimization problems
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- scientific article; zbMATH DE number 7753389
- A new necessary and sufficient global optimality condition for canonical DC problems
- Successive search methods for solving a canonical DC programming problem
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Optimality conditions in DC-constrained optimization
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Just relax: convex programming methods for identifying sparse signals in noise
- Title not available (Why is that?)
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Convex analysis and global optimization
- Convergence of time-stepping schemes for passive and extended linear complementarity systems
- A difference of convex formulation of value-at-risk constrained optimization
- Title not available (Why is that?)
- Locating Objects in the Plane Using Global Optimization Techniques
- A method for solving reverse convex programming problems
- Convex programs with an additional reverse convex constraint
- Outer approximation algorithms for canonical DC problems
- Approximate optimality conditions and stopping criteria in canonical DC programming
- Convex programs with several additional reverse convex constraints
- Title not available (Why is that?)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Canonical DC programming problem: Outer approximation methods revisited
- On nonconvex optimization problems with separated nonconvex variables
- Title not available (Why is that?)
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
Cited In (3)
This page was built for publication: Beyond canonical dc-optimization: the single reverse polar problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935286)
