DOI10.1137/11083085XzbMath1270.90110OpenAlexW2134656178MaRDI QIDQ4899018
Renato D. C. Monteiro, Benar Fux Svaiter
Publication date: 4 January 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/11083085x
A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities,
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods,
Iterative Methods for the Elastography Inverse Problem of Locating Tumors,
Backward-forward algorithms for structured monotone inclusions in Hilbert spaces,
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems,
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors,
On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems,
Smooth monotone stochastic variational inequalities and saddle point problems: a survey,
A proximal-Newton method for unconstrained convex optimization in Hilbert spaces,
A closed-loop supply chain equilibrium model with random and price-sensitive demand and return,
Weak versus strong convergence of a regularized Newton dynamic for maximal monotone operators,
Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization,
A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems,
Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations,
Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms,
Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds,
Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities,
An Optimal High-Order Tensor Method for Convex Optimization,
A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
