A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Strategy for Constrained Optimal Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of second-order methods for convex \(\ell _1\)-regularized optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Primal-Dual Active Set Strategy as a Semismooth Newton Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Active Set Method for Quadratic Problems with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bound constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank

Latest revision as of 17:32, 10 July 2024

scientific article
Language Label Description Also known as
English
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
scientific article

    Statements

    A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (English)
    0 references
    0 references
    0 references
    9 September 2015
    0 references
    primal-dual active set methods
    0 references
    quadratic programming
    0 references
    box constraints
    0 references
    convex programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references