An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
From MaRDI portal
Publication:4441947
DOI10.1137/S1052623400376135zbMath1043.90061OpenAlexW2076887500MaRDI QIDQ4441947
No author found.
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400376135
Convex programming (90C25) Numerical methods involving duality (49M29) Quadratic programming (90C20)
Related Items (14)
\(hp\)-adaptive IPDG/TDG-FEM for parabolic obstacle problems ⋮ Active Set Methods with Reoptimization for Convex Quadratic Integer Programming ⋮ A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds ⋮ Regularization of inverse problems via box constrained minimization ⋮ An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems ⋮ Numerical solutions of the \(m\)-membranes problem ⋮ Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs ⋮ Biorthogonal basis functions in \(hp\)-adaptive FEM for elliptic obstacle problems ⋮ An optimization problem related to the modeling of atmospheric inorganic aerosols. ⋮ On a semi-smooth Newton method and its globalization ⋮ A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix ⋮ An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation ⋮ Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves ⋮ A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
Uses Software
This page was built for publication: An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
