This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems. 1
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
Thesis (Ph. D.)--University of Washington, 1990Large-scale problems in convex optimization often can...
We analyze the convergence rate of an asynchronous space decomposition method for constrained convex...
This paper gives some global and uniform convergence estimates for a class of subspace correction (b...
Convergence of a space decomposition method is proved for a class of convex programming problems. A ...
The full approximation storage (FAS) scheme is a widely used multigrid method for nonlinear problems...
AbstractThis paper gives an overview for the method of subspace corrections. The method is first mot...
In this paper we discuss domain reduction strategies for global optimization problems with a nonconv...
This book presents state-of-the-art results and methodologies in modern global optimization, and has...
In this paper we discuss domain reduction strategies for global optimization problems with a nonconv...
The minimization of a functional composed of a nonsmooth and nonadditive regularization term and a c...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
We establish necessary and sufficient conditions for linear convergence of operator splitting method...
A class of trust region based algorithms is presented for the solution of nonlinear optimization pro...
The first order condition of the constrained minimization problem leads to a saddle point problem. A...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
Thesis (Ph. D.)--University of Washington, 1990Large-scale problems in convex optimization often can...
We analyze the convergence rate of an asynchronous space decomposition method for constrained convex...
This paper gives some global and uniform convergence estimates for a class of subspace correction (b...
Convergence of a space decomposition method is proved for a class of convex programming problems. A ...
The full approximation storage (FAS) scheme is a widely used multigrid method for nonlinear problems...
AbstractThis paper gives an overview for the method of subspace corrections. The method is first mot...
In this paper we discuss domain reduction strategies for global optimization problems with a nonconv...
This book presents state-of-the-art results and methodologies in modern global optimization, and has...
In this paper we discuss domain reduction strategies for global optimization problems with a nonconv...
The minimization of a functional composed of a nonsmooth and nonadditive regularization term and a c...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
We establish necessary and sufficient conditions for linear convergence of operator splitting method...
A class of trust region based algorithms is presented for the solution of nonlinear optimization pro...
The first order condition of the constrained minimization problem leads to a saddle point problem. A...
We consider the fast solution of non-smooth optimization problems as resulting for example from the ...
Thesis (Ph. D.)--University of Washington, 1990Large-scale problems in convex optimization often can...
We analyze the convergence rate of an asynchronous space decomposition method for constrained convex...
DOI
Add to ORKG