Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
From MaRDI portal
Publication:626646
DOI10.1007/S10589-009-9237-6zbMATH Open1230.90142OpenAlexW2031611552MaRDI QIDQ626646FDOQ626646
Authors: Z. Dostál, Marta Domorádová, Marie Sadowská 
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
Recommendations
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Projected gradient methods for linearly constrained problems
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
quadratic programmingrate of convergencefinite terminationbound constraintsinexact active set strategy
Cites Work
- Numerical Optimization
- Title not available (Why is that?)
- The conjugate gradient method in extremal problems
- Title not available (Why is that?)
- Projected gradient methods for linearly constrained problems
- Iterative Solution Methods
- A New Active Set Algorithm for Box Constrained Optimization
- A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
- The rate of convergence of conjugate gradients
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- 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
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- On the decrease of a quadratic function along the projected-gradient path
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Optimal quadratic programming algorithms. With applications to variational inequalities
- A new trust region algorithm for bound constrained minimization
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Scalable FETI with optimal dual penalty for a variational inequality
- Scalable FETI algorithms for frictionless contact problems
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Scalability and FETI based algorithm for large discretized variational inequalities
- Projector preconditioning for partially bound-constrained quadratic optimization
- Theoretically supported scalable BETI method for variational inequalities
- A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface
- A scalable FETI-DP algorithm for a semi-coercive variational inequality
- A scalable FETI-DP algorithm for a coercive variational inequality
- Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Efficient contact solvers based on domain decomposition techniques.
Cited In (10)
- Title not available (Why is that?)
- Convergence and local-to-global results for \(p\)-superminimizers on quasiopen sets
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems
- Engineering Multibody Contact Problems Solved by Scalable TBETI
This page was built for publication: Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626646)
