An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
From MaRDI portal
Publication:3083314
Recommendations
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- An algorithm for global minimization of linearly constrained quadratic functions
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- scientific article; zbMATH DE number 3922383
Cited in
(18)- Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- Algorithm and separating method for the optimisation of quadratic functions
- On preconditioning of penalized matrices
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- 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
- 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
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- An active-set algorithm for norm constrained quadratic problems
- Optimal iterative QP and QPQC algorithms
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum
- 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
- Engineering Multibody Contact Problems Solved by Scalable TBETI
This page was built for publication: An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083314)
