A direct active set algorithm for large sparse quadratic programs with simple bounds
From MaRDI portal
(Redirected from Publication:583116)
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- A General Quadratic Programming Algorithm
- A chordal preconditioner for large-scale optimization
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- A direct method for sparse least squares problems with lower and upper bounds
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for bound constrained quadratic programming problems
- Computing a Trust Region Step
- Computing the Minimum Fill-In is NP-Complete
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Numerically stable methods for quadratic programming
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projected gradient methods for linearly constrained problems
- Some NP-complete problems in quadratic and nonlinear programming
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- The Use of Linear Graphs in Gauss Elimination
Cited in
(17)- A binarisation heuristic for non-convex quadratic programming with box constraints
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem
- The adventures of a simple algorithm
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- The sagitta method for solving linear programs
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Penalty algorithm based on conjugate gradient method for solving portfolio management problem
- Model‐based solution approach for a short‐term flight rescheduling problem in aerial passenger transportation to maritime units
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- Sparse kernel learning with LASSO and Bayesian inference algorithm
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- A new algorithm for the general quadratic programming problems with box constraints
- scientific article; zbMATH DE number 4152153 (Why is no real title available?)
- A sparse counterpart of Reichel and Gragg's package QRUP
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- The probabilistic constraints in the support vector machine
This page was built for publication: A direct active set algorithm for large sparse quadratic programs with simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583116)
