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

DOI10.1137/S0036142903436393zbMath1089.65047MaRDI QIDQ5700260

Publication date: 28 October 2005

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

global convergence numerical experiments contact problems adaptive precision control large and sparse matrices strictly convex quadratic programming augmented Lagrangian-type algorithm box and equality constraints semicoercive elliptic variational inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Variational inequalities (49J40) Contact in solid mechanics (74M15)

Related Items (16)

An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum ⋮ Parallel solution of contact shape optimization problems based on total FETI domain decomposition method ⋮ A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction ⋮ A scalable TFETI algorithm for two-dimensional multibody contact problems with friction ⋮ On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems ⋮ An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum ⋮ Combined interior-point method and semismooth Newton method for frictionless contact problems ⋮ Augmented Lagrangian methods under the constant positive linear dependence constraint qualification ⋮ Scalable TFETI algorithm for the solution of multibody contact problems of elasticity ⋮ Theoretically supported scalable BETI method for variational inequalities ⋮ FETI-based algorithms for modelling of fibrous composite materials with debonding ⋮ Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ Quasi-Newton acceleration for equality-constrained minimization ⋮ A scalable FETI-DP algorithm for a semi-coercive variational inequality ⋮ Total FETI based algorithm for contact problems with additional non-linearities

Uses Software

LANCELOT

This page was built for publication: Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming