A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s11590-016-1070-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2508878802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / 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: A linear-time algorithm for trust region problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized trust region subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in trust region algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality for generalized trust region subproblem: S-lemma with interval bounds / rank
 
Normal rank

Latest revision as of 20:33, 14 July 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for the trust region subproblem based on hidden convexity
scientific article

    Statements

    A linear-time algorithm for the trust region subproblem based on hidden convexity (English)
    0 references
    0 references
    0 references
    15 December 2017
    0 references
    trust region subproblem
    0 references
    hidden convexity
    0 references
    proximal gradient algorithm
    0 references
    linear time complexity
    0 references
    0 references
    0 references

    Identifiers