Minimizing quadratic functions with separable quadratic constraints
From MaRDI portal
Recommendations
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Matrix computation and the theory of moments
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- The conjugate gradient method in extremal problems
Cited in
(16)- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Minimization of a convex quadratic function with two-sided constraints for variables
- Minimizing quadratic functions with semidefinite Hessian subject to bound constraints
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- An improved closed-form solution for the constrained minimization of the root of a quadratic functional
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Solution of 3D contact shape optimization problems with Coulomb friction based on TFETI.
- Minimization of quadratic functionals with constraints in the form of equalities
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics.
- An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem.
- On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction
This page was built for publication: Minimizing quadratic functions with separable quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5436913)
