Methods for Global Concave Minimization: A Bibliographic Survey
From MaRDI portal
Recommendations
- On the global minimization of concave functions
- scientific article; zbMATH DE number 757675
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- scientific article; zbMATH DE number 3913569
- scientific article; zbMATH DE number 5064899
Cited in
(69)- Conditions for boundedness in concave programming under reverse convex and convex constraints
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Global minimization of indefinite quadratic problems
- Enumerative techniques for solving some nonconvex global optimization problems
- Quadratic problems defined on a convex hull of points
- 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
- 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
- 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
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Construction of test problems for concave minimization under linear and nonlinear constraints
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Primal-relaxed dual global optimization approach
- 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
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- 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
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices
- Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming
- Nonconvex optimization over a polytope using generalized capacity improvement
- Integral global minimization: Algorithms, implementations and numerical tests
- Solving polyhedral d.c. optimization problems via concave minimization
- Maximization of a PSD quadratic form and factorization
- 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
- A numerical approach for solving some convex maximization problems
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- Generalized primal-relaxed dual approach for global optimization
- On the equivalence between some discrete and continuous optimization problems
- An implicit enumeration method for global optimization problems
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Global minimization algorithms for concave quadratic programming problems
- A novel approach for nonconvex optimal control problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Solution of a non-linear programming problem with quadratic functions
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- Convex Maximization via Adjustable Robust Optimization
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Inscribed ball and enclosing box methods for the convex maximization problem
- Unboundedness in reverse convex and concave integer programming
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- Robust bilevel optimization for near-optimal lower-level solutions
- A normal fan projection algorithm for low-rank optimization
- Non-convex optimization problems with linear KKT subsystem
- Indiscriminate disruption of conditional inference on multivariate Gaussians
- Globally solving concave quadratic programs via doubly nonnegative relaxation
- Outlier detection of multivariate data via the maximization of the cumulant generating function
- 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
- 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
- On the use of cuts in reverse convex programs
- 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
This page was built for publication: Methods for Global Concave Minimization: A Bibliographic Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738933)
