Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method

Qihang Lin, Yangyang Xu

Type: Article

Publication Date: 2023-01-17

Citations: 3

DOI: https://doi.org/10.1137/22m1469584

View Publication

Locations

SIAM Journal on Optimization - View

Similar Works

Action	Title	Year	Authors
+	Inexact accelerated proximal gradient method with line search and reduced complexity for affine-constrained and bilinear saddle-point structured convex problems	2022	Qihang Lin Yangyang Xu
+ PDF Chat	An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems	2021	Weiwei Kong Renato D. C. Monteiro
+ PDF Chat	An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems	2023	Arnesh Sujanani Renato D. C. Monteiro
+	An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems	2022	Arnesh Sujanani Renato D. C. Monteiro
+ PDF Chat	An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems	2020	Weiwei Kong Jefferson G. Melo Renato D. C. Monteiro
+	An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems	2018	Weiwei Kong Jefferson G. Melo Renato D. C. Monteiro
+ PDF Chat	Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints	2022	Weiwei Kong Jefferson G. Melo Renato D. C. Monteiro
+	Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems	2020	Jefferson G. Melo Renato D. C. Monteiro Hairong Wang
+ PDF Chat	An Adaptive Proximal ADMM for Nonconvex Linearly-Constrained Composite Programs	2024	Leandro Farias Maia David H. Gutman Renato D. C. Monteiro Gilson N. Silva
+	Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints	2023	Hari Dahal Wei Liu Yangyang Xu
+	Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs	2018	Weiwei Kong Jefferson G. Melo Renato D. C. Monteiro
+	Accelerated forward-backward method with fast convergence rate for nonsmooth convex optimization beyond differentiability	2021	Wei Bian Fan Wu
+ PDF Chat	Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs	2019	Weiwei Kong Jefferson G. Melo Renato D. C. Monteiro
+	An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles	2019	Deyi Liu Quoc Tran-Dinh
+	An Accelerated Block Proximal Framework with Adaptive Momentum for Nonconvex and Nonsmooth Optimization	2023	Weifeng Yang Wenwen Min
+ PDF Chat	AGDA+: Proximal Alternating Gradient Descent Ascent Method With a Nonmonotone Adaptive Step-Size Search For Nonconvex Minimax Problems	2024	Xuan Zhang Qiushui Xu Necdet Serhat Aybat
+ PDF Chat	The boosted proximal difference-of-convex algorithm	2023	Ziyue Hu Qiao‐Li Dong Xiaolong Qin
+	An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization	2023	Ruyu Liu Shaohua Pan Yitian Qian
+	A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems	2019	Jiaming Liang Renato D. C. Monteiro Chee-Khian Sim
+	Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems	2016	Quanming Yao James T. Kwok Fei Gao Wei Chen Tie‐Yan Liu

Works That Cite This (3)

Action	Title	Year	Authors
+	Inertial accelerated augmented Lagrangian algorithms with scaling coefficients to solve exactly and inexactly linearly constrained convex optimization problems	2024	Xin He Rong Hu Ya-Ping Fang
+	Indefinite Linearized Augmented Lagrangian Method for Convex Programming with Linear Inequality Constraints	2024	Bingsheng He Shengjie Xu Jing Yuan
+	Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints	2024	Xin He

Works Cited by This (50)

Action	Title	Year	Authors
+ PDF Chat	Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization	2016	Andrei Pătraşcu Ion Necoara Quoc Tran-Dinh
+	A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion	2013	Yangyang Xu Wotao Yin
+	Smoothing and First Order Methods: A Unified Framework	2012	Amir Beck Marc Teboulle
+	Inexact accelerated augmented Lagrangian methods	2015	Myeongmin Kang Myungjoo Kang Miyoun Jung
+	An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization	2014	Qihang Lin Lin Xiao
+	Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing	2008	Wotao Yin Stanley Osher Donald Goldfarb Jérôme Darbon
+	Accelerated and Inexact Forward-Backward Algorithms	2013	Silvia Villa Saverio Salzo Luca Baldassarre Alessandro Verri
+ PDF Chat	Accelerated Linearized Bregman Method	2012	Bo Huang Shiqian Ma Donald Goldfarb
+	Gradient methods for minimizing composite functions	2012	Yu. Nesterov
+	Iteration-complexity of first-order augmented Lagrangian methods for convex programming	2015	Guanghui Lan Renato D. C. Monteiro