A Successive Underestimation Method for Concave Minimization Problems

Cited in

(77)

A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
Least trimmed squares regression, least median squares regression, and mathematical program\-ming
A linear programming approach to solving bilinear programmes
Fractional programming with convex quadratic forms and functions
Quasiconvex relaxations based on interval arithmetic
Multi-level programming and conflict resolution
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
Simplicially-constrained DC optimization over efficient and weakly efficient sets
Variations and extension of the convex-concave procedure
A combined cutting-stock and lot-sizing problem
A note on adapting methods for continuous global optimization to the discrete case
Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
Existence and sum decomposition of vertex polyhedral convex envelopes
DC programming: overview.
A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
Global minimization of large-scale constrained concave quadratic problems by separable programming
Concave minimization under linear constraints with special structure
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
Computational approaches to variance-penalised Markov decision processes
Outer approximation by polyhedral convex sets
Penalty for zero–one integer equivalent problem
Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming
Canonical DC programming problem: Outer approximation methods revisited
On-line and off-line vertex enumeration by adjacency lists
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
Some results on the strength of relaxations of multilinear functions
Concave extensions for nonlinear 0-1 maximization problems
Subdivision of simplices relative to a cutting plane and finite concave minimization
Monotone variable-metric algorithm for linearly constrained nonlinear programming
On the structure and properties of a linear multilevel programming problem
On solving a d.c. programming problem by a sequence of linear programs
Optimization over the efficient set
A generalized duality and applications
Efficient algorithms for solving rank two and rank three bilinear programming problems
Minimization of a quasi-concave function over an efficient set
A mathematical programming approach to a problem in variance penalised Markov decision processes
A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems
Using convex envelopes to solve the interactive fixed-charge linear programming problem
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
Optimization methods for mixed integer weakly concave programming problems
A branch and bound-outer approximation algorithm for concave minimization over a convex set
Linear multiplicative programming
A new algorithm for solving the general quadratic programming problem
A parametric successive underestimation method for convex multiplicative programming problems
Separable concave minimization via partial outer approximation and branch and bound
A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems
Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
Convergence of a subgradient method for computing the bound norm of matrices
A method for globally minimizing concave functions over convex sets
An algorithm for optimizing over the weakly-efficient set
A heuristic for the continuous capacity and flow assignment
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
Minimizing a quasi-concave function subject to a reverse convex constraint
Construction of large-scale global minimum concave quadratic test problems
An exact penalty on bilevel programs with linear vector optimization lower level
Convex programs with an additional reverse convex constraint
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
Global minimum test problem construction
On the global minimization of concave functions
On the minimization of a quasi-concave function subject to linear constraints
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Algorithms for parametric nonconvex programming
Convex minimization under Lipschitz constraints
Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
On an outer approximation concept in global optimization
A parallel algorithm for constrained concave quadratic global minimization
A new algorithm to find all vertices of a polytope
A decomposition approach for global optimum search in QP, NLP and MINLP problems
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
A general purpose exact solution method for mixed integer concave minimization problems
Two new reformulation convexification based hierarchies for 0-1 MIPs
scientific article; zbMATH DE number 7312765 (Why is no real title available?)
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
A generalization of the construction of test problems for nonconvex optimization
D.c sets, d.c. functions and nonlinear equations
Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation

This page was built for publication: A Successive Underestimation Method for Concave Minimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136948)