A level set algorithm for a class of reverse convex programs

DOI10.1007/BF02283685zbMath0714.90078OpenAlexW1992170532MaRDI QIDQ751513

Sihem Ben Saad, Stephen E. Jacobsen

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02283685

zbMATH Keywords

conical partitionadditional reverse convex constraintlevel set algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A generalization of the construction of test problems for nonconvex optimization, Comments on a reverse convex programming algorithm, Construction of test problems for a class of reverse convex programs, Intersection Disjunctions for Reverse Convex Sets, Canonical DC programming problem: Outer approximation methods revisited, A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation, A new necessary and sufficient global optimality condition for canonical DC problems, The complexity results of the sparse optimization problems and reverse convex optimization problems, Feasible partition problem in reverse convex and convex mixed-integer programming, Outer approximation algorithms for canonical DC problems, Computational experience using an edge search algorithm for linear reverse convex programs

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex programs with an additional reverse convex constraint
• The design centering problem as a d.c. programming problem
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• Generation of large-scale quadratic programs for use as global optimization test problems
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• Methods for Global Concave Minimization: A Bibliographic Survey
• Complementary Geometric Programming
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• Global minimum test problem construction
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems