A successive linear approximation algorithm for the global minimization of a concave quadratic program
DOI10.1007/s40314-020-01317-1zbMath1463.90152OpenAlexW3084962387MaRDI QIDQ827382
Mohamed Telli, Abdelkader Mokhtari, Mohand Bentobache
Publication date: 7 January 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-020-01317-1
global optimizationlinear programmingnumerical experimentslevel curveapproximation setsconcave quadratic programming
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear and nonlinear programming.
- Global optimality conditions for nonconvex optimization
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Handbook of test problems in local and global optimization
- On the construction of test problems for concave minimization algorithms
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A two-phase support method for solving linear programs: numerical experiments
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- General Quadratic Programming and Its Applications in Response Surface Analysis
- Global minimization algorithms for concave quadratic programming problems
- Convergent Algorithms for Minimizing a Concave Function
- Credit cards scoring with quadratic utility functions
- Benchmarking state-of-the-art classification algorithms for credit scoring
- Global minimum test problem construction
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- A hybrid direction algorithm for solving linear programs
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Convex analysis and global optimization
This page was built for publication: A successive linear approximation algorithm for the global minimization of a concave quadratic program