( en | de | ru )

 

Disambiguation of "Monteiro, Renato D. C."

Author of the publication

copydeleteadd this publication to your clipboard
An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems.

, and . Optim. Methods Softw., 32 (6): 1244-1272 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Renato Monteiro Vieira Braga

Renato C Müller

Katharina D C Stärk

Maria Monteiro

Teresa Monteiro

 

Other publications of authors with the same name

Local Minima and Convergence in Low-Rank Semidefinite Programming., and . Math. Program., 103 (3): 427-444 (2005)Iteration-complexity of first-order penalty methods for convex programming., and . Math. Program., 138 (1-2): 115-139 (2013)A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming., , and . SIAM J. Optimization, 19 (4): 1918-1946 (2009)Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds., , and . SIAM J. Optimization, 26 (4): 2730-2743 (2016)Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers., and . SIAM J. Optimization, 23 (1): 475-507 (2013)Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework., , and . SIAM J. Optimization, 27 (1): 379-407 (2017)An adaptive accelerated first-order method for convex optimization., , and . Comput. Optim. Appl., 64 (1): 31-73 (2016)A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming., and . Optim. Methods Softw., 18 (1): 1-38 (2003)Asymptotic behavior of the central path for a special class of degenerate SDP problems., , and . Math. Program., 103 (3): 487-514 (2005)Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming., and . SIAM J. Optim., 34 (1): 201-224 (March 2024)