A reduced proximal-point homotopy method for large-scale non-convex BQP
From MaRDI portal
Publication:2114822
DOI10.1007/S10589-021-00330-2zbMATH Open1487.90514OpenAlexW4210451099MaRDI QIDQ2114822FDOQ2114822
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
Recommendations
- Partially reduced sqp methods for large-scale nonlinear optimization problems
- A redistributed proximal bundle method for nonconvex optimization
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- Bregman proximal relaxation of large-scale 0-1 problems
- scientific article; zbMATH DE number 7753387
- scientific article
- An efficient method for non-convex QCQP problems
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Proximal point methods and nonconvex optimization
Cites Work
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Title not available (Why is that?)
- Newton's Method for Large Bound-Constrained Optimization Problems
- CUTE
- Pegasos: primal estimated sub-gradient solver for SVM
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Methods for Modifying Matrix Factorizations
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A Limited Memory Algorithm for Bound Constrained Optimization
- Title not available (Why is that?)
- Smooth minimization of non-smooth functions
- Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
- On a problem of the theory of lubrication governed by a variational inequality
- The finite element methods for elliptic problems.
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A New Active Set Algorithm for Box Constrained Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- Proximal point methods and nonconvex optimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Projected Newton Methods for Optimization Problems with Simple Constraints
- An online active set strategy to overcome the limitations of explicit MPC
- A method for solving nonlinear maximum‐problems depending on parameters
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A Block-$LU$ Update for Large-Scale Linear Programming
- Quasi-Newton approach to nonnegative image restorations
- Maintaining LU factors of a general sparse matrix
- Stable modification of explicitLU factors for simplex updates
- The simplex method of linear programming using LU decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularization of inverse problems via box constrained minimization
- PAL-Hom method for QP and an application to LP
Uses Software
This page was built for publication: A reduced proximal-point homotopy method for large-scale non-convex BQP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114822)
