Beyond canonical dc-optimization: the single reverse polar problem

DOI10.1007/S10957-012-0069-7MaRDI QIDQ1935286zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

cutting plane algorithmsapproximate optimality conditionssingle reverse polar problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

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

Cites work

• scientific article; zbMATH DE number 4011808 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 4119956 (Why is no real title available?)
• scientific article; zbMATH DE number 1906319 (Why is no real title available?)
• scientific article; zbMATH DE number 757676 (Why is no real title available?)
• A difference of convex formulation of value-at-risk constrained optimization
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint
• A method for solving reverse convex programming problems
• Approximate optimality conditions and stopping criteria in canonical DC programming
• Canonical DC programming problem: Outer approximation methods revisited
• Convergence of time-stepping schemes for passive and extended linear complementarity systems
• Convex analysis and global optimization
• Convex programs with an additional reverse convex constraint
• Convex programs with several additional reverse convex constraints
• Just relax: convex programming methods for identifying sparse signals in noise
• Locating Objects in the Plane Using Global Optimization Techniques
• On a new class of bilevel programming problems and its use for reformulating mixed integer problems
• On nonconvex optimization problems with separated nonconvex variables
• On the Global Solution of Linear Programs with Linear Complementarity Constraints
• Outer approximation algorithms for canonical DC problems
• Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems

Cited in

(3)

• The ABC of DC programming
• Outer approximation algorithms for DC programs and beyond
• Outer approximation algorithms for canonical DC problems

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)