A reduced proximal-point homotopy method for large-scale non-convex BQP
From MaRDI portal
Publication:2114822
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; zbMATH DE number 3848110
- 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
- scientific article; zbMATH DE number 3889119 (Why is no real title available?)
- scientific article; zbMATH DE number 3850845 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Block-$LU$ Update for Large-Scale Linear Programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A method for solving nonlinear maximum‐problems depending on parameters
- An online active set strategy to overcome the limitations of explicit MPC
- CUTE
- Error bounds and convergence analysis of feasible descent methods: A general approach
- LIBLINEAR: a library for large linear classification
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Maintaining LU factors of a general sparse matrix
- Methods for Modifying Matrix Factorizations
- Newton's Method for Large Bound-Constrained Optimization Problems
- On a problem of the theory of lubrication governed by a variational inequality
- PAL-Hom method for QP and an application to LP
- Pegasos: primal estimated sub-gradient solver for SVM
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Proximal point methods and nonconvex optimization
- Quasi-Newton approach to nonnegative image restorations
- Regularization of inverse problems via box constrained minimization
- Smooth minimization of non-smooth functions
- Stable modification of explicitLU factors for simplex updates
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The finite element methods for elliptic problems.
- The simplex method of linear programming using LU decomposition
- qpOASES: a parametric active-set algorithm for~quadratic programming
Describes a project that uses
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)
