Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
From MaRDI portal
Publication:1122325
DOI10.1007/BF02239754zbMath0675.65063OpenAlexW2025530912MaRDI QIDQ1122325
Reiner Horst, Nguyen Van Thoai
Publication date: 1989
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02239754
global optimizationnumerical examplescomputational efficiencyouter approximation algorithmcone splittingCSAlinearly constrained concave minimizationOAAPAApolyhedral annexation
Related Items
On a stochastic bilevel programming problem, Constraint decomposition algorithms in global optimization, On the construction of test problems for concave minimization algorithms, On solving general reverse convex programming problems by a sequence of linear programs and line searches, New LP bound in multivariate Lipschitz optimization: Theory and applications, Can linear programs be used to test global optimization algorithms?, Decomposition approach for the global minimization of biconcave functions over polytopes, On global optimality conditions and cutting plane algorithms, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, An analytical approach to global optimization, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation, A global optimization approach for solving the convex multiplicative programming problem, Polyhedral annexation, dualization and dimension reduction technique in global optimization, Hybrid approach for solving multiple-objective linear programs in outcome space, Construction of test problems for concave minimization under linear and nonlinear constraints, Test problem construction for linear bilevel programming problems, Subdivision of simplices relative to a cutting plane and finite concave minimization, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Computational experience using an edge search algorithm for linear reverse convex programs, A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program, A quasiconcave minimization method for solving linear two-level programs, Concave minimization via conical partitions and polyhedral outer approximation, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
Cites Work
- Unnamed Item
- On the global minimization of concave functions
- An outer approximation method for globally minimizing a concave function over a compact convex set
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Constrained global optimization: algorithms and applications
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Normal conical algorithm for concave minimization over polytopes
- Methods for Global Concave Minimization: A Bibliographic Survey
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- Convergent Algorithms for Minimizing a Concave Function
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
