A subspace SQP method for equality constrained optimization (Q2322557): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: L-BFGS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEst / 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/s10589-019-00109-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2946675118 / 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: Q4840764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for large-scale nonlinear optimization / 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: A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating Quasi-Newton Matrices with Limited Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace Study on Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted limited-memory variable metric methods for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace methods for large scale nonlinear equations and nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace choices for the Celis-Dennis-Tapia problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subspace properties of the quadratically constrained quadratic program / rank
 
Normal rank

Latest revision as of 08:38, 20 July 2024

scientific article
Language Label Description Also known as
English
A subspace SQP method for equality constrained optimization
scientific article

    Statements

    A subspace SQP method for equality constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2019
    0 references
    equality constrained optimization
    0 references
    SQP method
    0 references
    large scale problems
    0 references
    subspace techniques
    0 references
    damped limited-memory BFGS update
    0 references
    0 references
    0 references

    Identifiers

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