Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CG+ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ESSL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BLAS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LOQO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OOPS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-006-9043-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044815392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Large-Scale Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method based on interior point techniques for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible interior methods using slacks for nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel interior-point solver for structured linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4654838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / 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: Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbiosis between linear algebra and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Cholesky Factorizations with Limited Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning indefinite systems in interior point methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Preconditioning for Indefinite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method for Large Bound-Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of level 3 basic linear algebra subprograms / 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: Algorithms for bound constrained quadratic programming problems / rank
 
Normal rank

Revision as of 09:24, 26 June 2024

scientific article
Language Label Description Also known as
English
Interior-point solver for large-scale quadratic programming problems with bound constraints
scientific article

    Statements

    Interior-point solver for large-scale quadratic programming problems with bound constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2007
    0 references
    Bound-constrained quadratic programming
    0 references
    potential reduction method
    0 references
    conjugate gradient method
    0 references
    incomplete Cholesky factorization
    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