An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
From MaRDI portal
(Redirected from Publication:715072)
Recommendations
- An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem.
- Minimizing quadratic functions with separable quadratic constraints
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- 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
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- 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
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Minimizing quadratic functions with separable quadratic constraints
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Maximization of a Concave Quadratic Function with Box Constraints
- On the decrease of a quadratic function along the projected-gradient path
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Scalability and FETI based algorithm for large discretized variational inequalities
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics
- Solving the Signorini problem on the basis of domain decomposition techniques
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Trust Region Methods
Cited in
(23)- Minimizing quadratic functions with separable quadratic constraints
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Reorthogonalization-based stiffness preconditioning in FETI algorithms with applications to variational inequalities.
- 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
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Some results for quadratic problems with one or two quadratic constraints
- An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem.
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- Positive definite separable quadratic programs for non-convex problems
- Total-FETI method for solving contact elasto-plastic problems
- Algorithm and separating method for the optimisation of quadratic functions
- Engineering Multibody Contact Problems Solved by Scalable TBETI
- Minimizing quadratic functions with semidefinite Hessian subject to bound constraints
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics.
- The last dozen of years of or research in Czechia and Slovakia
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- Optimal iterative QP and QPQC algorithms
- Discretization and numerical realization of contact problems for elastic-perfectly plastic bodies. II: Numerical realization, limit analysis
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- 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
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)
