A Primal–Dual Smooth Perceptron–von Neumann Algorithm

Negar Soheili, Javier Peña

Type: Book-Chapter

Publication Date: 2013-01-01

Citations: 12

DOI: https://doi.org/10.1007/978-3-319-00200-2_17

View Publication

Locations

Fields Institute communications - View

Similar Works

Action	Title	Year	Authors
+	Nonlinear Programming Theory and Computation	1973	O. L. Mangasarian
+	A primal–dual prediction–correction algorithm for saddle point optimization	2016	Hongjin He Jitamitra Desai Kai Wang
+	A convex dual problem for the rational minimax approximation and Lawson’s iteration	2024	Lei‐Hong Zhang Linyi Yang Wei Hong Yang Yanan Zhang
+	A smoothing and regularization Broyden-like method for nonlinear inequalities	2012	Haitao Che Meixia Li
+	Smooth Optimization Problems. Saddle Point Conditions	2004
+	A sharp Lagrange multiplier theorem for nonlinear programs	2015	M. Ruiz Galán
+	Non‐Smooth Optimization	2000	R. Fletcher
+	The Newton-Kantorovich Theorem and Mathematical Programming	2007
+ PDF Chat	Non-smooth Non-convex Bregman Minimization: Unification and New Algorithms	2018	Peter Ochs Jalal Fadili Thomas Brox
+	Lipschitz and Continuous Optimization	1996	Reiner Horst Hoàng Tụy
+	Lipschitz and Continuous Optimization	1990	Reiner Horst Hoàng Tụy
+	Lipschitz and Continuous Optimization	1993	Reiner Horst Hoàng Tụy
+	Nonsmoothness in Machine Learning: specific structure, proximal identification, and applications	2020	Franck Iutzeler Jérôme Malick
+	Nonsmoothness in Machine Learning: specific structure, proximal identification, and applications	2020	Franck Iutzeler Jérôme Malick
+ PDF Chat	Nonsmoothness in Machine Learning: Specific Structure, Proximal Identification, and Applications	2020	Franck Iutzeler Jérôme Malick
+	Continuous Problems	1998	Ravi P. Agarwal
+ PDF Chat	A fully stochastic primal-dual algorithm	2020	Pascal Bianchi Walid Hachem Adil Salim
+	Chapter 2. A Survey Of Continuous Minimax Algorithms	2009
+ PDF Chat	Smoothing methods for convex inequalities and linear complementarity problems	1995	Chunhui Chen O. L. Mangasarian
+ PDF Chat	Convex Optimization: Algorithms and Complexity	2015	Sébastien Bubeck

Works That Cite This (8)

Action	Title	Year	Authors
+	Springer Proceedings in Mathematics & Statistics	2013	D. Jallo V. Budai Vladimir Boginski Boris Goldengorin Pãnos M. Pardalos
+ PDF Chat	Towards a deeper geometric, analytic and algorithmic understanding of margins	2015	Aaditya Ramdas Javier Peña
+ PDF Chat	On the von Neumann and Frank--Wolfe Algorithms with Away Steps	2016	Javier Peña Daniel Rodríguez Negar Soheili
+ PDF Chat	Solving Conic Systems via Projection and Rescaling	2016	Javier Peña Negar Soheili
+	On the von Neumann and Frank-Wolfe Algorithms with Away Steps	2015	Javier Peña Daniel Rodríguez Negar Soheili
+	Solving Conic Systems via Projection and Rescaling	2015	Javier Peña Negar Soheili
+ PDF Chat	A new extension of Chubanov’s method to symmetric cones	2023	Shin-ichi Kanoh Akiko Yoshise
+	Elementary Algorithms for Solving Convex Optimization Problems	2014	Negar Soheili Azad

Works Cited by This (8)

Action	Title	Year	Authors
+ PDF Chat	Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system	2000	Marina A. Epelman Robert M. Freund
+ PDF Chat	Linear programming, complexity theory and elementary functional analysis	1995	James Renegar
+ PDF Chat	Incorporating Condition Measures into the Complexity Theory of Linear Programming	1995	James Renegar
+	Second-order cone programming	2003	Farid Alizadeh Donald Goldfarb
+ PDF Chat	Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm	1999	Robert M. Freund Jorge Vera
+	A simple polynomial-time rescaling algorithm for solving linear programs	2007	John Dunagan Santosh Vempala
+ PDF Chat	Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems	2004	Arkadi Nemirovski
+	A new condition number for linear programming	2001	Dennis Cheung Felipe Cucker