Beyond canonical dc-optimization: the single reverse polar problem
From MaRDI portal
Publication:1935286
DOI10.1007/s10957-012-0069-7zbMath1257.90076OpenAlexW2127140420WikidataQ118165460 ScholiaQ118165460MaRDI QIDQ1935286
Antonio Frangioni, Giancarlo Bigi, 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
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Convex programs with an additional reverse convex constraint
- Convex programs with several additional reverse convex constraints
- A method for solving reverse convex programming problems
- On nonconvex optimization problems with separated nonconvex variables
- 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
- Canonical DC programming problem: Outer approximation methods revisited
- Outer approximation algorithms for canonical DC problems
- Convergence of Time-Stepping Schemes for Passive and Extended Linear Complementarity Systems
- Locating Objects in the Plane Using Global Optimization Techniques
- Just relax: convex programming methods for identifying sparse signals in noise
- Approximate optimality conditions and stopping criteria in canonical DC programming
- A difference of convex formulation of value-at-risk constrained optimization
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Convex analysis and global optimization
