Box Constrained Quadratic Programming with Proportioning and Projections
From MaRDI portal
Publication:4377570
DOI10.1137/S1052623494266250zbMath0912.65052MaRDI QIDQ4377570
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
convergencequadratic programmingnumerical experimentsiterative algorithmsconjugate gradientsinexact subproblem solutionprojected search
Related Items
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ A decomposition method for large-scale box constrained optimization ⋮ Signorini problem with a solution dependent coefficient of friction (model with given friction): Approximation and numerical realization. ⋮ An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum ⋮ Optimal iterative QP and QPQC algorithms ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ Mixed finite element approximation of 3D contact problems with given friction: Error analysis and numerical realization ⋮ Contact on Multiprocessor Environment: from Multicontact Problems to Multiscale Approaches ⋮ Augmented Lagrangian active set methods for obstacle problems ⋮ Duality based domain decomposition with proportioning for the solution of free boundary problems ⋮ A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints ⋮ Approximation and numerical realization of 2D contact problems with Coulomb friction and a solution-dependent coefficient of friction ⋮ A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers ⋮ Separable spherical constraints and the decrease of a quadratic function in the gradient projection step ⋮ A scalable TFETI algorithm for two-dimensional multibody contact problems with friction ⋮ An algorithm for the numerical realization of 3D contact problems with Coulomb friction. ⋮ Unnamed Item ⋮ A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Scalable TFETI algorithm for the solution of multibody contact problems of elasticity ⋮ A Robin algorithm for unilateral contact problems ⋮ Duality-based domain decomposition with natural coarse-space for variational inequalities ⋮ Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems ⋮ A scalable FETI-DP algorithm for a coercive variational inequality ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface ⋮ FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction ⋮ Minimizing quadratic functions with separable quadratic constraints ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ A filter-trust-region method for simple-bound constrained optimization ⋮ Efficient contact solvers based on domain decomposition techniques. ⋮ Semi–Smooth Newton Methods for Variational Inequalities of the First Kind ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon ⋮ An affine-scaling interior-point CBB method for box-constrained optimization ⋮ Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence ⋮ A scalable FETI-DP algorithm for a semi-coercive variational inequality ⋮ Solution of contact problems by FETI domain decomposition with natural coarse space projections ⋮ On a splitting type algorithm for the numerical realization of contact problems with Coulomb friction ⋮ Scalability and FETI based algorithm for large discretized variational inequalities ⋮ Implementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type technique ⋮ Proportioning with second-order information for model predictive control
