Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
From MaRDI portal
(Redirected from Publication:626646)
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1513394 (Why is no real title available?)
- scientific article; zbMATH DE number 1424210 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
- A new trust region algorithm for bound constrained minimization
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- A scalable FETI-DP algorithm for a coercive variational inequality
- A scalable FETI-DP algorithm for a semi-coercive variational inequality
- A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Efficient contact solvers based on domain decomposition techniques.
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Iterative Solution Methods
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Numerical Optimization
- Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
- On the Maximization of a Concave Quadratic Function with Box Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the decrease of a quadratic function along the projected-gradient path
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Projected gradient methods for linearly constrained problems
- Projector preconditioning for partially bound-constrained quadratic optimization
- Scalability and FETI based algorithm for large discretized variational inequalities
- Scalable FETI algorithms for frictionless contact problems
- Scalable FETI with optimal dual penalty for a variational inequality
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Solving the Signorini problem on the basis of domain decomposition techniques
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The conjugate gradient method in extremal problems
- The rate of convergence of conjugate gradients
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- Theoretically supported scalable BETI method for variational inequalities
Cited in
(10)- scientific article; zbMATH DE number 1855602 (Why is no real title available?)
- 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)
