Methods for Global Concave Minimization: A Bibliographic Survey
From MaRDI portal
Publication:3738933
DOI10.1137/1028106zbMath0602.90105OpenAlexW2043339930MaRDI QIDQ3738933
Panos M. Pardalos, J. Ben Rosen
Publication date: 1986
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1028106
bilinear programmingconcave functionlarge scalebibliographic surveyconstrained global minimumglobal concave minimization
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Least trimmed squares regression, least median squares regression, and mathematical program\-ming, A finite concave minimization algorithm using branch and bound and neighbor generation, On the role of continuously differentiable exact penalty functions in constrained global optimization, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Global minimization of indefinite quadratic problems, An Algorithm for Maximizing a Convex Function Based on Its Minimum, Enumerative techniques for solving some nonconvex global optimization problems, Quadratic problems defined on a convex hull of points, On the equivalence between some discrete and continuous optimization problems, An implicit enumeration method for global optimization problems, Global minimization of large-scale constrained concave quadratic problems by separable programming, Nonconvex optimization over a polytope using generalized capacity improvement, On the global minimization of a convex function under general nonconvex constraints, A parallel algorithm for constrained concave quadratic global minimization, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Unboundedness in reverse convex and concave integer programming, Convex Maximization via Adjustable Robust Optimization, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Solving polyhedral d.c. optimization problems via concave minimization, On the use of cuts in reverse convex programs, Global minimization algorithms for concave quadratic programming problems, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, Allocating procurement to capacitated suppliers with concave quantity discounts, To be fair or efficient or a bit of both, The interactive fixed charge inhomogeneous flows optimization problem, Normal conical algorithm for concave minimization over polytopes, Quadratic programming with one negative eigenvalue is NP-hard, An all-linear programming relaxation algorithm for optimizing over the efficient set, Maximization of a PSD quadratic form and factorization, An interior point algorithm to solve computationally difficult set covering problems, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, Reduction of indefinite quadratic programs to bilinear programs, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, Feasible partition problem in reverse convex and convex mixed-integer programming, On the solution of concave knapsack problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Separable concave minimization via partial outer approximation and branch and bound, Note on the complexity of the mixed-integer hull of a polyhedron, On finding a generalized lowest rank solution to a linear semi-definite feasibility problem, A numerical approach for solving some convex maximization problems, Inscribed ball and enclosing box methods for the convex maximization problem, Conditions for boundedness in concave programming under reverse convex and convex constraints, Generalized \(\gamma\)-valid cut procedure for concave minimization, Construction of test problems for concave minimization under linear and nonlinear constraints, A level set algorithm for a class of reverse convex programs, A branch and bound-outer approximation algorithm for concave minimization over a convex set, A novel approach for nonconvex optimal control problems, An algorithm for a class of nonlinear fractional problems using ranking of the vertices, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Generalized primal-relaxed dual approach for global optimization, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Solution of a non-linear programming problem with quadratic functions, Algorithms for the solution of quadratic knapsack problems, Global optimization algorithms for linearly constrained indefinite quadratic problems, Concave minimization via conical partitions and polyhedral outer approximation, Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Primal-relaxed dual global optimization approach
Uses Software
