Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241): Difference between revisions

@@ Property / cites work @@
+An interior algorithm for nonlinear optimization that combines line search and trust region steps
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual subgradient methods for convex problems
+Normal rank
@@ Property / cites work @@
+Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
+Normal rank
@@ Property / cites work @@
+Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
+Normal rank
@@ Property / cites work @@
+Universal gradient methods for convex optimization problems
+Normal rank
@@ Property / cites work @@
+A universal modification of the linear coupling method
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064562419020042
+Normal rank
@@ Property / OpenAlex ID @@
+W2951523010
@@ Property / OpenAlex ID: W2951523010 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127677930
@@ Property / Wikidata QID: Q127677930 / rank @@
+Normal rank