A new method of moving asymptotes for large-scale unconstrained optimization (Q2518690): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2008.03.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013780395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of moving asymptotes—a new method for structural optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method of moving asymptotes with trust region technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a nonlinear programming method using convex approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank

Latest revision as of 00:12, 29 June 2024

scientific article
Language Label Description Also known as
English
A new method of moving asymptotes for large-scale unconstrained optimization
scientific article

    Statements

    A new method of moving asymptotes for large-scale unconstrained optimization (English)
    0 references
    0 references
    0 references
    16 January 2009
    0 references
    This article presents a method of moving asymptotes to solve large-scale unconstrained optimization problems of a twice continuously differentiable function. The authors begin with a brief introduction to this general problem and a survey of the relevant literature on moving asymptote methods including several useful theorems. In the third section the authors present their innovative algorithm and prove its convergence. The article concludes with a series of tables presenting the results of the numerical experimentation, ideas for future extensions and a list of relevant references.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    method of moving asymptotes
    0 references
    trust region
    0 references
    linear search
    0 references
    large scale optimization
    0 references
    unconstrained optimization
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical experimentation
    0 references
    0 references
    0 references
    0 references