A modified nearly exact method for solving low-rank trust region subproblem (Q868456): Difference between revisions

From MaRDI portal
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: CUTEr / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GQTPAR / 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/s10107-006-0025-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135778653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with penalty-barrier methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Estimate for the Condition Number of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new unconstrained optimization algorithms which use function and gradient values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The trust region subproblem and semidefinite programming* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal Locally Constrained Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem using the Lanczos Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method with a Model Trust Region Modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization / rank
 
Normal rank

Latest revision as of 15:27, 25 June 2024

scientific article
Language Label Description Also known as
English
A modified nearly exact method for solving low-rank trust region subproblem
scientific article

    Statements

    A modified nearly exact method for solving low-rank trust region subproblem (English)
    0 references
    0 references
    0 references
    5 March 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    limited-memory BFGS method
    0 references
    Sherman-Morrison-Woodbury formula
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references