A variant of trust-region methods for unconstrained optimization (Q2518723): 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: minpack / 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.1016/j.amc.2008.04.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972272528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid conjugate gradient methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust region method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method for a class of multiplicative programming with exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-Newton trust-region method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal Locally Constrained Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Unconstrained Optimization / 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: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of the trust region problem by minimization over two-dimensional subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914337 / 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: On the global convergence of trust region algorithms for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a new trust region algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic Approximations and Collinear Scalings for Optimizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>Q</i>-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conic Algorithm for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for Trust-Region Subproblems Involving a Conic Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank

Latest revision as of 00:12, 29 June 2024

scientific article
Language Label Description Also known as
English
A variant of trust-region methods for unconstrained optimization
scientific article

    Statements

    A variant of trust-region methods for unconstrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2009
    0 references
    The authors study alternatives to the traditional trust-region methods used to solve unconstrained optimization problems. They begin by introducing the general unconstrained optimization problem and presenting on overview of the relevant literature. In the second section they focus on the traditional trust-region methods using the quadratic model for solving this optimization problem and outline the characteristics, properties and shortfalls of these approaches. A further extension of the trust-region method is described in the third section which uses the conic model. In the fourth section, the authors present the main contribution of this article, namely a new trust-region method based on a linear model for unconstrained optimization. Several theorems are presented, with proof, including the convergence properties of the proposed algorithm. The last section of this paper includes the detailed results of the performed computational experimentation and a section of concluding remarks.
    0 references
    0 references
    0 references
    0 references
    0 references
    trust-region methods
    0 references
    linear model
    0 references
    quadratic model
    0 references
    conic model
    0 references
    unconstrained optimization
    0 references
    numerical examples
    0 references
    convergence
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references