New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming

DOI10.1007/s10898-021-01108-wzbMath1490.90212OpenAlexW3216841913MaRDI QIDQ2124794

Mohand Bentobache, Mohamed Telli, Abdelkader Mokhtari

Publication date: 11 April 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01108-w

zbMATH Keywords

extreme pointnumerical experimentsnonconvex quadratic programmingsimplex algorithmlocal minimizerglobal minimizersuccessive linear programmingconcave quadratic programmingapproximate global minimizer

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Optimization of a quadratic programming problem over an Integer efficient set

Uses Software

• CUTEr
• CPLEX
• GLOBALLib
• NewtonKKTqp
• quadprogIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• A successive linear approximation algorithm for the global minimization of a concave quadratic program
• Newton-KKT interior-point methods for indefinite quadratic 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
• The search for a global maximum of a convex functional on an admissible set
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• DC programming and DCA: thirty years of developments
• An algorithm for maximizing a convex function over a simple set
• A new algorithm for concave quadratic programming
• Linear programming using MATLAB
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A continuous approch for globally solving linearly constrained quadratic
• General Quadratic Programming and Its Applications in Response Surface Analysis
• The Simplex Method for Quadratic Programming
• Global minimization algorithms for concave quadratic programming problems
• An algorithm for nonconvex programming problems
• Global minimum test problem construction
• A new exact algorithm for concave knapsack problems with integer variables
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• Computationally Related Problems
• CUTEr and SifDec
• Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
• Convex analysis and global optimization
• DC programming approaches for discrete portfolio optimization under concave transaction costs

This page was built for publication: New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming