Optimal iterative QP and QPQC algorithms
From MaRDI portal
Recommendations
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- Convex quadratic programming with one constraint and bounded variables
- Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A block active set algorithm for large-scale quadratic programming with box constraints
- A new trust region algorithm for bound constrained minimization
- A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
- 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 \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Analysis and implementation of a dual algorithm for constrained optimization
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Iterative Solution Methods
- Linear time algorithms for some separable quadratic programming problems
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with application
- On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems
- On preconditioning of penalized matrices
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Parallel solution of contact shape optimization problems based on total FETI domain decomposition method
- Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
- Scalable total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering
Cited in
(5)- Comparison of generalized Q- function algorithms (Corresp.)
- Improving the Convergence of the Periodic QZ Algorithm
- Specialized fast algorithms for IQC feasibility and optimization problems.
- scientific article; zbMATH DE number 6169004 (Why is no real title available?)
- On a scalable nonparametric denoising of time series signals
This page was built for publication: Optimal iterative QP and QPQC algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338894)
