Characterization of local solutions for a class of nonconvex programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- Generalized Benders decomposition
- Iterative Solution of Nonlinear Optimal Control Problems
- Partitioning procedures for solving mixed-variables programming problems
- The Validity of a Family of Optimization Methods
Cited in
(16)- An algorithm for optimizing network flow capacity under economies of scale
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- Construction of test problems for a class of reverse convex programs
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- Reverse convex problems: an approach based on optimality conditions
- Reverse convex programming
- On the global minimization of a convex function under general nonconvex constraints
- Convex programs with an additional reverse convex constraint
- A level set algorithm for a class of reverse convex programs
- Linear programs with an additional reverse convex constraint
- Computational experience using an edge search algorithm for linear reverse convex programs
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- On the use of cuts in reverse convex programs
- Intersection Disjunctions for Reverse Convex Sets
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
This page was built for publication: Characterization of local solutions for a class of nonconvex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843382)
