An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications

Cites Work

Title not available (Why is that?)
Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
Trust Region Methods
Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
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
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
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
A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
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
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
Minimizing quadratic functions with separable quadratic constraints
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
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
Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
Scalability and FETI based algorithm for large discretized variational inequalities
Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics

Cited In (15)

Efficient methods for solving the Stokes problem with slip boundary conditions
The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
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
Total-FETI Method for Solving Contact Elasto-Plastic Problems
Optimal iterative QP and QPQC algorithms
A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
Reorthogonalization‐based stiffness preconditioning in FETI algorithms with applications to variational inequalities
The last dozen of years of or research in Czechia and Slovakia
Discretization and numerical realization of contact problems for elastic-perfectly plastic bodies. II: Numerical realization, limit analysis
Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
Engineering Multibody Contact Problems Solved by Scalable TBETI

Uses Software

MatSol

This page was built for publication: An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715072)