Minimizing quadratic functions with separable quadratic constraints

DOI10.1080/10556780600609246zbMath1136.65062OpenAlexW2063066053MaRDI QIDQ5436913

Radek Kučera

Publication date: 18 January 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780600609246

zbMATH Keywords

convergencequadratic programminglinear elasticitynumerical examplesconjugate gradient methodcontact problemsadaptive precision controlactive set methodisotropic frictionPolyak's algorithmsseparable quadratic constraints

Mathematics Subject Classification ID

Related Items (9)

On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction ⋮ Solution of 3D contact shape optimization problems with Coulomb friction based on TFETI. ⋮ Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate ⋮ An interior-point algorithm for the minimization arising from 3D contact problems with friction ⋮ Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction ⋮ The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction

Cites Work

• Unnamed Item
• An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• Matrix computation and the theory of moments
• Box Constrained Quadratic Programming with Proportioning and Projections
• Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
• The conjugate gradient method in extremal problems

This page was built for publication: Minimizing quadratic functions with separable quadratic constraints