A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
DOI10.1137/08071524XzbMATH Open1203.65095MaRDI QIDQ3586145FDOQ3586145
Authors: Zaiwen Wen, Donald Goldfarb 
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- scientific article; zbMATH DE number 2163982
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- A matrix-free line-search algorithm for nonconvex optimization
- A Practical Algorithm for General Large Scale Nonlinear Optimization Problems
- Successive linearization methods for large-scale nonlinear programming problems
- Efficient matrix-free direction method with line search for solving large-scale system of nonlinear equations
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- An efficient line search for nonlinear least squares
- A new linesearch algorithm for nonlinear least squares problems
algorithmglobal convergencecomputational efficiencyline searchinfinite-dimensional optimizationmultiscale problemsBroyden-Fletcher-Goldfarb-Shanno (BFGS) methodlarge-scale nonlinear optimizationconvex and nonconvex optimizationmultigrid/multilevel method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cited In (25)
- First-order geometric multilevel optimization for discrete tomography
- On a multilevel Levenberg-Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations
- Title not available (Why is that?)
- A parallel splitting method for separable convex programs
- A new subspace correction method for nonlinear unconstrained convex optimization problems
- Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- An ADM-based splitting method for separable convex programming
- A multilevel proximal gradient algorithm for a class of composite optimization problems
- MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
- Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics
- Line search multilevel optimization as computational methods for dense optical flow
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations
- On high-order multilevel optimization strategies
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
- A multi-layer line search method to improve the initialization of optimization algorithms
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- Coordinate search algorithms in multilevel optimization
- Newton-type multilevel optimization method
- A multilevel method for self-concordant minimization
- Properties of a class of multilevel optimization algorithms for equality-constrained problems
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Riemannian multigrid line search for low-rank problems
- Factors affecting the performance of optimization-based multigrid methods
- Reconstructing local volatility using total variation
Uses Software
This page was built for publication: A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586145)
