Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
From MaRDI portal
Publication:626646
DOI10.1007/s10589-009-9237-6zbMath1230.90142OpenAlexW2031611552MaRDI QIDQ626646
Marie Sadowská, Zdeněk Dostál, Marta Domorádová
Publication date: 18 February 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9237-6
rate of convergencequadratic programmingbound constraintsfinite terminationinexact active set strategy
Related Items (7)
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ Engineering Multibody Contact Problems Solved by Scalable TBETI ⋮ Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation ⋮ A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction ⋮ Separable spherical constraints and the decrease of a quadratic function in the gradient projection step ⋮ Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the decrease of a quadratic function along the projected-gradient path
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Theoretically supported scalable BETI method for variational inequalities
- Optimal quadratic programming algorithms. With applications to variational inequalities
- A scalable FETI-DP algorithm for a semi-coercive variational inequality
- The rate of convergence of conjugate gradients
- Solving the Signorini problem on the basis of domain decomposition techniques
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A new trust region algorithm for bound constrained minimization
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Scalability and FETI based algorithm for large discretized variational inequalities
- A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface
- A scalable FETI-DP algorithm for a coercive variational inequality
- Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
- Projector preconditioning for partially bound-constrained quadratic optimization
- Scalable FETI with optimal dual penalty for a variational inequality
- A New Active Set Algorithm for Box Constrained Optimization
- A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
- Projected gradient methods for linearly constrained problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Numerical Optimization
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Iterative Solution Methods
- Box Constrained Quadratic Programming with Proportioning and Projections
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- The conjugate gradient method in extremal problems
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Efficient contact solvers based on domain decomposition techniques.
This page was built for publication: Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
