A new subspace correction method for nonlinear unconstrained convex optimization problems

DOI10.1007/S10255-012-0185-ZMaRDI QIDQ692728zbMATH OpenOpenAlexFDO

Authors Rongliang Chen, Jinping Zeng

Publication date 6 December 2012

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-012-0185-z

zbMATH Keywords

convergencenumerical resultsalgorithmmultigrid methodminimal surface problemnonlinear unconstrained convex optimizationsubspace correction method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Nonlinear programming (90C30) Minimal surfaces and optimization (49Q05)

Recommendations

• Global and uniform convergence of subspace correction methods for some convex optimization problems
• A general two-level subspace method for nonlinear optimization
• Subspace trust-region algorithm with conic model for unconstrained optimization
• Convergence analysis of the fast subspace descent method for convex optimization problems
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization

Cites work

• A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
• A multigrid approach to discretized optimization problems
• A multigrid method for distributed parameter estimation problems
• A multigrid scheme for elliptic constrained optimal control problems
• Analysis of a damped nonlinear multilevel method
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Iterative Methods by Space Decomposition and Subspace Correction
• Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• Multigrid Methods for PDE Optimization
• Multigrid optimization methods for linear and bilinear elliptic optimal control problems
• Neumann--Neumann Domain Decomposition Preconditioners for Linear-Quadratic Elliptic Optimal Control Problems
• On the convergence of the MG/OPT method
• On the convergence rate of a space decomposition method
• On the multi-grid method applied to difference equations
• On the nonlinear domain decomposition method
• Optimization theory and methods. Nonlinear programming
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems

Cited in

(8)

• Convergence analysis of the fast subspace descent method for convex optimization problems
• A parallel line search subspace correction method for composite convex optimization
• Efficient algorithms for solving the p-Laplacian in polynomial time
• A general two-level subspace method for nonlinear optimization
• Surrogate functional based subspace correction methods for image processing
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization
• Global and uniform convergence of subspace correction methods for some convex optimization problems

This page was built for publication: A new subspace correction method for nonlinear unconstrained convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692728)