On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem

DOI10.1360/012011-1049zbMath1488.90137OpenAlexW2320810314MaRDI QIDQ5017754

Yuan Shen, Bing-sheng He

Publication date: 17 December 2021

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/012011-1049

zbMATH Keywords

convex optimizationmonotone operatorconvergence rate

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem ⋮ A proximal point-like method for symmetric finite element model updating problems ⋮ Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization ⋮ PPA-like contraction methods for convex optimization: a framework using variational inequality approach

This page was built for publication: On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem