An active set trust-region method for bound-constrained optimization (Q2169274): 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: CUTEst / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / 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/s41980-021-00610-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3186505040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficiently combining limited-memory and trust-region techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / 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: Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage active-set algorithm for bound-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise complexity analyses for trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective algorithm for minimization / 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: Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Limited Memory Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point affine-scaling trust-region method for semismooth equations with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMBOPT: a limited memory method for bound-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limited memory quasi-Newton trust-region method for box constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank

Latest revision as of 02:05, 30 July 2024

scientific article
Language Label Description Also known as
English
An active set trust-region method for bound-constrained optimization
scientific article

    Statements

    An active set trust-region method for bound-constrained optimization (English)
    0 references
    0 references
    2 September 2022
    0 references
    bound-constrained optimization
    0 references
    active set method
    0 references
    trust-region method
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers