Preconditioned iterative methods for a class of nonlinear eigenvalue problems preconditioned iterative
methods: preconditioned simple iteration
method, preconditioned steepest
descent method Convex optimization problems with arbitrary right-hand side perturbations descent type
method to find its solution. If the primal cost function does not possess strengthened
Decomposition descent method for limit optimization problems decomposition
descent method. Its convergence is attained under coercivity type conditions.
Descent methods for monotone equilibrium problems in Banach spaces bifunction. We propose a combined regularization and
descent method for this problem and establish strong
Decentralized multi-agent optimization based on a penalty methodWe propose a decentralized penalty
method for general convex constrained multi-agent optimization
Convex optimization problems with arbitrary right-hand side perturbations descent type
method to find its solution. If the primal cost function does not possess strengthened
Preconditioned iterative methods for a class of nonlinear eigenvalue problems preconditioned iterative
methods: preconditioned simple iteration
method, preconditioned steepest
descent method