An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
From MaRDI portal
Publication:715072
DOI10.1007/s10107-011-0454-2zbMath1259.65089OpenAlexW1997208781MaRDI QIDQ715072
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0454-2
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Quadratic programming (90C20)
Related Items (14)
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ Engineering Multibody Contact Problems Solved by Scalable TBETI ⋮ Optimal iterative QP and QPQC algorithms ⋮ The last dozen of years of or research in Czechia and Slovakia ⋮ Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation ⋮ The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ Efficient methods for solving the Stokes problem with slip boundary conditions ⋮ Reorthogonalization‐based stiffness preconditioning in FETI algorithms with applications to variational inequalities ⋮ Discretization and numerical realization of contact problems for elastic-perfectly plastic bodies. PART II - numerical realization, limit analysis ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate ⋮ Total-FETI Method for Solving Contact Elasto-Plastic Problems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- On the decrease of a quadratic function along the projected-gradient path
- Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Solving the Signorini problem on the basis of domain decomposition techniques
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Scalability and FETI based algorithm for large discretized variational inequalities
- Lectures on Modern Convex Optimization
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- A nonlinear programming approach to the unilateral contact-, and friction-boundary value problem in the theory of elasticity
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Trust Region Methods
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Minimizing quadratic functions with separable quadratic constraints
- Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
This page was built for publication: An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
