A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-016-9886-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-016-9886-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2558001808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numeric computation of the projection of a point onto a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of saddle point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse nonlinear optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterative algorithms for linear least squares problems with bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix augmentation and partitioning in the updating of the basis inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual-active-set algorithm for positive semi-definite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected gradient methods for linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves / 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: An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior-point algorithm for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal quadratic programming algorithms. With applications to variational inequalities / 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: MA57---a code for the solution of sparse symmetric definite and indefinite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual active-set methods for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Derivative SQP Method: Global Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual regularized interior-point method for convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solver for Nonconvex Bound-Constrained Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual fast projected gradient method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An out-of-core sparse Cholesky solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast factorization pivoting methods for sparse symmetric indefinite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOQO:an interior point code for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Limited SQP Method For Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-016-9886-1 / rank
 
Normal rank

Latest revision as of 18:40, 16 December 2024

scientific article
Language Label Description Also known as
English
A dual gradient-projection method for large-scale strictly convex quadratic problems
scientific article

    Statements

    A dual gradient-projection method for large-scale strictly convex quadratic problems (English)
    0 references
    0 references
    0 references
    28 July 2017
    0 references
    convex optimization
    0 references
    quadratic programming
    0 references
    gradient projection
    0 references
    large-scale optimization
    0 references
    sparse factorizations
    0 references
    dual method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers