Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CUTE / 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/s10589-007-9050-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063958776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between constant positive linear dependence condition and quasinormality constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact spectral projected gradient methods on convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limited-memory multipoint symmetric secant method for bound constrained optimization / 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: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behaviour of some new gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: R-linear convergence of the Barzilai and Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Change Secant Updates for Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality-based domain decomposition with natural coarse-space for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A test for cancellation errors in quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and implementation of a dual algorithm for constrained optimization / 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: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton methods for solving nonsmooth equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Barzilai and Borwein choice of steplength for the gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 778: L-BFGS-B / rank
 
Normal rank

Latest revision as of 20:44, 27 June 2024

scientific article
Language Label Description Also known as
English
Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
scientific article

    Statements

    Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (English)
    0 references
    0 references
    0 references
    3 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    Nonlinear programming
    0 references
    Augmented Lagrangian methods
    0 references
    Box constraints
    0 references
    Quasi-Newton
    0 references
    Truncated-Newton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references