An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints

Authors:
Zdeněk Dostál;Radek Kučera
Affiliations:
zdenek.dostal@vsb.cz;radek.kucera@vsb.cz
Venue:
SIAM Journal on Optimization
Year:
2010

Citing 18
Cited 2

A method of analytic centers for quadratically constrained convex quadratic programs

SIAM Journal on Numerical Analysis
An unconventional domain decomposition method for an efficient parallel solution of large-scale finite element systems

SIAM Journal on Scientific and Statistical Computing - Special issue on iterative methods in numerical linear algebra
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Trust-region methods

Trust-region methods
Lectures on modern convex optimization: analysis, algorithms, and engineering applications

Lectures on modern convex optimization: analysis, algorithms, and engineering applications
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming

SIAM Journal on Optimization
Box Constrained Quadratic Programming with Proportioning and Projections

SIAM Journal on Optimization
Implementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type technique

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization

SIAM Journal on Optimization
An algorithm for the numerical realization of 3D contact problems with Coulomb friction

Journal of Computational and Applied Mathematics - Special Issue: Proceedings of the 10th international congress on computational and applied mathematics (ICCAM-2002)
Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination

Computational Optimization and Applications
Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming

SIAM Journal on Numerical Analysis
An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum

Computing
Minimizing quadratic functions with separable quadratic constraints

Optimization Methods & Software
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints

SIAM Journal on Optimization
Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics

Computing
Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities

Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities
A scalable TFETI algorithm for two-dimensional multibody contact problems with friction

Journal of Computational and Applied Mathematics

Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction

Journal of Computational and Applied Mathematics
Original article: Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An, in a sense, optimal algorithm for minimization of quadratic functions subject to separable convex inequality and linear equality constraints is presented. Its unique feature is an error bound in terms of bounds on the spectrum of the Hessian of the cost function. If applied to a class of problems with the spectrum of the Hessians in a given positive interval, the algorithm can find approximate solutions in a uniformly bounded number of simple iterations, such as matrix-vector multiplications. Moreover, if the class of problems admits a sparse representation of the Hessian, it simply follows that the cost of the solution is proportional to the number of unknowns. Theoretical results are illustrated by numerical experiments.