A new subspace correction method for nonlinear unconstrained convex optimization problems

DOI10.1007/s10255-012-0185-zzbMath1277.65043OpenAlexW2064716858MaRDI QIDQ692728

Rong-liang Chen, Jin-ping 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

algorithmconvergencenumerical resultsmultigrid methodminimal surface problemnonlinear unconstrained convex optimizationsubspace correction method

Mathematics Subject Classification ID

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

Related Items (2)

A subspace conjugate gradient algorithm for large-scale unconstrained optimization ⋮ Efficient algorithms for solving the \(p\)-Laplacian in polynomial time

Cites Work

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

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