A level set algorithm for a class of reverse convex programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 3422216 (Why is no real title available?)
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- Complementary Geometric Programming
- Convex programs with an additional reverse convex constraint
- Generation of large-scale quadratic programs for use as global optimization test problems
- Global minimum test problem construction
- Iterative Solution of Nonlinear Optimal Control Problems
- Linear programs with an additional reverse convex constraint
- Methods for Global Concave Minimization: A Bibliographic Survey
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Reverse convex programming
- The Validity of a Family of Optimization Methods
- The design centering problem as a d.c. programming problem
Cited in
(16)- scientific article; zbMATH DE number 3930734 (Why is no real title available?)
- Outer approximation algorithms for canonical DC problems
- A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation
- Canonical DC programming problem: Outer approximation methods revisited
- A conical branch-and-bound algorithm for a class of reverse convex programs
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- Comments on a reverse convex programming algorithm
- scientific article; zbMATH DE number 94024 (Why is no real title available?)
- A generalization of the construction of test problems for nonconvex optimization
- Construction of test problems for a class of reverse convex programs
- Feasible partition problem in reverse convex and convex mixed-integer programming
- A new necessary and sufficient global optimality condition for canonical DC problems
- Computational experience using an edge search algorithm for linear reverse convex programs
- Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.
- Intersection Disjunctions for Reverse Convex Sets
- Level-set methods for convex optimization
This page was built for publication: A level set algorithm for a class of reverse convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751513)
