On the Maximization of a Concave Quadratic Function with Box Constraints

DOI10.1137/0804010zbMath0801.65058OpenAlexW2053299192MaRDI QIDQ4294751

Ana Friedlander, José Mario Martínez

Publication date: 4 December 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804010

zbMATH Keywords

algorithmconvex quadratic programmingtest problemsactive set and gradient projection methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)

Related Items (26)

Augmented lagrangians and sphere packing problems ⋮ On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ Optimal iterative QP and QPQC algorithms ⋮ A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines ⋮ 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 ⋮ A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers ⋮ A trust-region-approach for solving a parameter estimation problem from the biotechnology area ⋮ An algorithm for the numerical realization of 3D contact problems with Coulomb friction. ⋮ Unnamed Item ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ Scalable TFETI algorithm for the solution of multibody contact problems of elasticity ⋮ Duality-based domain decomposition with natural coarse-space for variational inequalities ⋮ Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization ⋮ Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves ⋮ 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

This page was built for publication: On the Maximization of a Concave Quadratic Function with Box Constraints