First-Order Methods

Zhu Han, Mingyi Hong, Wang Dan

Type: Book-Chapter

Publication Date: 2017-01-01

Citations: 10

DOI: https://doi.org/10.1017/9781316408032.003

Similar Works

Action	Title	Year	Authors
+	High-order methods	1994	J. M. Sanz‐Serna M. P. Calvo
+	Second-Order Non-linear Methods	2024	Eleuterio F. Toro
+	Higher order methods	1993	Gennadi Vainikko
+	First-Order Methods for Systems	2024	Eleuterio F. Toro
+	Reduced Order Methods	2016	Elisa Schenone Jack Hale Lars Beex Stéphane Bordas
+	First-Order Equations	2014	Martha L. Abell James P. Braselton
+	Higher-order Methods and Limiting Strategy	2014	Chongam Kim
+ PDF Chat	Hybrid High-Order Methods	2021	Matteo Cicuttin Alexandre Ern Nicolas Pignet
+	Iterative Methods	2018	R. C. Aster Brian Borchers C. H. Thurber
+	Iterative Methods	1966	Lothar Collatz
+	Iterative Methods	2013	Robert M. Corless Nicolas Fillion
+ PDF Chat	An Introduction to Hybrid High-Order Methods	2018	Daniele A. Di Pietro Roberta Tittarelli
+	SECOND-DEGREE METHODS	1971	David M. Young
+	Higher-order optimal methods	2012	Miodrag S. Petković Beny Neta Ljiljana D. Petković Jovana Džunić
+	High-Order Iterative Methods	2021	Ioannis K. Argyros
+	Second Order Approximation	2014	Katsushi Ikeuchi
+	Second Order Approximation	2021
+	Mathematical Methods	2017	Joel Franklin
+	First-Order Methods in Optimization	2017	Amir Beck
+	Approximate methods.	2014	Robert R. Bush Frederick Mosteller

Action	Title	Year	Authors
+ PDF Chat	Extensions of ADMM for separable convex optimization problems with linear equality or inequality constraints	2022	Bingsheng He Shengjie Xu Xiaoming Yuan
+	Bregman Extragradient Method with Monotone Rule of Step Adjustment*	2019	С. В. Денисов V. V. Semenov Petro Stetsyuk
+	Convergence rates analysis of multiobjective proximal gradient methods	2020	Hiroki Tanabe Ellen H. Fukuda Nobuo Yamashita
+ PDF Chat	Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs	2021	Radu Ioan Boţ Minh N. Dao Guoyin Li
+	A Note on the Equivalence of Operator Splitting Methods	2019	Walaa M. Moursi Yuriy Zinchenko
+ PDF Chat	Optimal Control of Parabolic Equations – A Spectral Calculus Based Approach	2023	Luka Grubišić Martin Lazar Ivica Nakić Martin Tautenhahn
+	Forward-backward algorithms with different inertial terms for the minimization of the sum of two non-convex functions	2020	Szilárd Csaba László
+ PDF Chat	The springback penalty for robust signal recovery	2022	Congpei An Hao-Ning Wu Xiaoming Yuan
+	POLO: a POLicy-based Optimization library.	2018	Arda Aytekin Martin Biel Mikael Johansson
+	Discrete Total Variation with Finite Elements and Applications to Imaging	2018	Marc Herrmann Roland Herzog Stephan Schmidt José Vidal-Núñez Gerd Wachsmuth

Action	Title	Year	Authors
+	Sparse convex optimization methods for machine learning	2011	Martin Jaggi
+	Some continuity properties of polyhedral multifunctions	1981	Stephen M. Robinson
+	Signal Recovery by Proximal Forward-Backward Splitting	2005	Patrick L. Combettes Valérie R. Wajs
+	Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence	2008	Elaine Hale Wotao Yin Yin Zhang
+	A coordinate gradient descent method for nonsmooth separable minimization	2007	Paul Tseng Sangwoon Yun
+	Monotone (nonlinear) operators in Hilbert space	1962	George J. Minty
+ PDF Chat	Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints	2008	Massimo Fornasier Holger Rauhut
+ PDF Chat	On the monotonicity of the gradient of a convex function	1964	George J. Minty
+ PDF Chat	On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization	1992	Zhi‐Quan Luo Paul Tseng
+	Error bounds and convergence analysis of feasible descent methods: a general approach	1993	Zhi-Quan Luo Paul Tseng