A reduced proximal-point homotopy method for large-scale non-convex BQP
type: Item
instance of: scholarly article
title: A reduced proximal-point homotopy method for large-scale non-convex BQP
zbMATH Open document ID: 1487.90514
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7490082
zbMATH Keywords: quadratic programming
zbMATH Keywords: box constraints
zbMATH Keywords: non-convex
zbMATH Keywords: proximal point method
zbMATH Keywords: homotopy method
describes a project that uses: CUTE
describes a project that uses: MINQ8
describes a project that uses: LBFGS-B
describes a project that uses: MINPACK-2
describes a project that uses: NNLS
describes a project that uses: LIBSVM
describes a project that uses: LIBLINEAR
describes a project that uses: qpOASES
describes a project that uses: MINQ
describes a project that uses: Pegasos
describes a project that uses: CUTEr
describes a project that uses: TRON
MaRDI profile type: Publication
full work available at URL: s10589-021-00330-2
OpenAlex ID: W4210451099
cites work: Quasi-Newton approach to nonnegative image restorations
cites work: The finite element methods for elliptic problems.
cites work: Q3221604
cites work: On a problem of the theory of lubrication governed by a variational inequality
cites work: Q3096176
cites work: Regularization of inverse problems via box constrained minimization
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: Smooth minimization of non-smooth functions
cites work: Newton's Method for Large Bound-Constrained Optimization Problems
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
cites work: A New Active Set Algorithm for Box Constrained Optimization
cites work: CUTE
cites work: A method for solving nonlinear maximum‐problems depending on parameters
cites work: Q3320146
cites work: qpOASES: a parametric active-set algorithm for~quadratic programming
cites work: The simplex method of linear programming using LU decomposition
cites work: Methods for Modifying Matrix Factorizations
cites work: A Block-$LU$ Update for Large-Scale Linear Programming
cites work: Stable modification of explicitLU factors for simplex updates
cites work: Maintaining LU factors of a general sparse matrix
cites work: Q4868585
cites work: An online active set strategy to overcome the limitations of explicit MPC
cites work: Q5491447
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: Proximal point methods and nonconvex optimization
cites work: PAL-Hom method for QP and an application to LP
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: MINQ8: general definite and bound constrained indefinite quadratic programming
cites work: Pegasos: primal estimated sub-gradient solver for SVM
DOI: 10.1007/S10589-021-00330-2
Recommended article: Partially reduced sqp methods for large-scale nonlinear optimization problems
Recommended article: A Redistributed Proximal Bundle Method for Nonconvex Optimization
Recommended article: A new bound-and-reduce approach of nonconvex quadratic programming problems
Recommended article: Bregman proximal relaxation of large-scale 0-1 problems
Recommended article: Q6076199
Recommended article: Q3317657
Recommended article: Q4992978
Recommended article: Proximal quasi-Newton methods for nondifferentiable convex optimization
Recommended article: A bundle Bregman proximal method for convex nondifferentiable minimization
Recommended article: Proximal point methods and nonconvex optimization
description: scientific article; zbMATH DE number 7490082