Beyond canonical dc-optimization: the single reverse polar problem
type: Item
instance of: scholarly article
title: Beyond canonical dc-optimization: the single reverse polar problem
zbMATH Open document ID: 1257.90076
author: Giancarlo Bigi
author: Antonio Frangioni
author: Qing-Hua Zhang
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-14T00:00:00Z
full work available at URL: http://hdl.handle.net/11568/188948
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6136268
zbMATH Keywords: single reverse polar problems
zbMATH Keywords: approximate optimality conditions
zbMATH Keywords: cutting plane algorithms
Wikidata QID: Q118165460
MaRDI profile type: Publication
OpenAlex ID: W2127140420
cites work: Canonical DC programming problem: Outer approximation methods revisited
cites work: Q4833805
cites work: Outer approximation algorithms for canonical DC problems
cites work: A finite cutting plane method for solving linear programs with an additional reverse convex constraint
cites work: A method for solving reverse convex programming problems
cites work: Q4733680
cites work: Convex programs with several additional reverse convex constraints
cites work: Q3761588
cites work: Convex programs with an additional reverse convex constraint
cites work: On nonconvex optimization problems with separated nonconvex variables
cites work: Convex analysis and global optimization
cites work: Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
cites work: Locating Objects in the Plane Using Global Optimization Techniques
cites work: A difference of convex formulation of value-at-risk constrained optimization
cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints
cites work: Q4806224
cites work: Just relax: convex programming methods for identifying sparse signals in noise
cites work: Convergence of Time-Stepping Schemes for Passive and Extended Linear Complementarity Systems
cites work: On a new class of bilevel programming problems and its use for reformulating mixed integer problems
cites work: Approximate optimality conditions and stopping criteria in canonical DC programming
cites work: Q3997222
DOI: 10.1007/S10957-012-0069-7
Recommended article: Optimality conditions for DC programming problems with reverse convex constraints
Recommended article: Canonical DC programming problem: Outer approximation methods revisited
Recommended article: A revision of the rectangular algorithm for a class of DC optimization problems
Recommended article: On d.c. optimization problems
Recommended article: Optimality conditions for D.C. vector optimization problems under reverse convex constraints
Recommended article: Q6076201
Recommended article: A new necessary and sufficient global optimality condition for canonical DC problems
Recommended article: Successive search methods for solving a canonical DC programming problem
Recommended article: On modeling and global solutions for d.c. optimization problems by canonical duality theory
Recommended article: Optimality conditions in DC-constrained optimization
description: scientific article; zbMATH DE number 6136268