A reduced proximal-point homotopy method for large-scale non-convex BQP

DOI10.1007/s10589-021-00330-2zbMath1487.90514OpenAlexW4210451099MaRDI QIDQ2114822

Yanyan Li

Publication date: 15 March 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-021-00330-2

zbMATH Keywords

quadratic programmingbox constraintshomotopy methodproximal point methodnon-convex

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Uses Software

• CUTEr
• TRON
• NNLS
• MINPACK-2
• LIBSVM
• LIBLINEAR
• MINQ
• qpOASES
• LBFGS-B
• Pegasos
• CUTE
• MINQ8

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• qpOASES: a parametric active-set algorithm for~quadratic programming
• Pegasos: primal estimated sub-gradient solver for SVM
• On a problem of the theory of lubrication governed by a variational inequality
• Proximal point methods and nonconvex optimization
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Quasi-Newton approach to nonnegative image restorations
• MINQ8: general definite and bound constrained indefinite quadratic programming
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Maintaining LU factors of a general sparse matrix
• Regularization of inverse problems via box constrained minimization
• PAL-Hom method for QP and an application to LP
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• A New Active Set Algorithm for Box Constrained Optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Stable modification of explicitLU factors for simplex updates
• A Block-$LU$ Update for Large-Scale Linear Programming
• CUTE
• Newton's Method for Large Bound-Constrained Optimization Problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Methods for Modifying Matrix Factorizations
• A Limited Memory Algorithm for Bound Constrained Optimization
• Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
• An online active set strategy to overcome the limitations of explicit MPC
• A method for solving nonlinear maximum‐problems depending on parameters
• The simplex method of linear programming using LU decomposition

This page was built for publication: A reduced proximal-point homotopy method for large-scale non-convex BQP