Convergent Algorithms for Minimizing a Concave Function
From MaRDI portal
Cited in
(59)- Convergence of a subgradient method for computing the bound norm of matrices
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A branch and bound algorithm for extreme point mathematical programming problems
- On the convergence of global methods in multiextremal optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- On the structure and properties of a linear multilevel programming problem
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Minimizing a quasi-concave function subject to a reverse convex constraint
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Normal conical algorithm for concave minimization over polytopes
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Convergence qualification of adaptive partition algorithms in global optimization
- Linear multiplicative programming
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Constraint decomposition algorithms in global optimization
- A branch bound method for subset sum problem
- Global optimization method for solving mathematical programs with linear complementarity constraints
- Convex minimization under Lipschitz constraints
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- Decomposition approach for the global minimization of biconcave functions over polytopes
- DC programming: overview.
- A convergent conical algorithm with -bisection for concave minimization
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Separable concave minimization via partial outer approximation and branch and bound
- Variations and extension of the convex-concave procedure
- A weighting method for 0-1 indefinite quadratic bilevel programming
- D.c sets, d.c. functions and nonlinear equations
- On the indefinite quadratic bilevel programming problem.
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- Optimization over equilibrium sets∗
- A generalization of -subdivision ensuring convergence of the simplicial algorithm
- Concave minimization under linear constraints with special structure
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- On the relation between concavity cuts and the surrogate dual for convex maximization problems
- Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Duality bound method for the general quadratic programming problem with quadratic constraints
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- A generalized duality and applications
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- An algorithm for solving convex programs with an additional convex- concave constraint
- Globally solving concave quadratic programs via doubly nonnegative relaxation
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- On the global minimization of concave functions
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- Concave minimization via conical partitions and polyhedral outer approximation
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- On the nonlinear multilevel programming problems
This page was built for publication: Convergent Algorithms for Minimizing a Concave Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3927058)
