Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
From MaRDI portal
Publication:2083351
DOI10.3934/jimo.2021174OpenAlexW3208649261MaRDI QIDQ2083351
Publication date: 10 October 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2021174
convergence rateproximal point algorithmlinearly constrained convex optimizationcontraction methodsLagrangian-PPA
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Fixed point and Bregman iterative methods for matrix rank minimization
- A class of customized proximal point algorithms for linearly constrained convex optimization
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- Proximal-point algorithm using a linear proximal term
- Inexact implicit methods for monotone general variational inequalities
- A class of projection and contraction methods for monotone variational inequalities
- Exact matrix completion via convex optimization
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A Singular Value Thresholding Algorithm for Matrix Completion
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Monotone Operators and the Proximal Point Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
This page was built for publication: Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization