Large-scale convex optimization. Algorithms \& analyses via monotone operators
From MaRDI portal
Publication:5097614
Recommendations
Cited in
(26)- A generalized forward-backward splitting operator: degenerate analysis and applications
- A primer on monotone operator methods
- Convex optimization: algorithms and complexity
- First-order methods in optimization
- Algorithms for convex optimization
- Splitting algorithms, modern operator theory, and applications. Based on the workshop on splitting algorithms, modern operator theory, and applications, Oaxaca, Mexico, September 17--22, 2017. Dedicated to the memory of Jonathan M. Borwein
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces
- An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions
- Port-Hamiltonian Systems Theory and Monotonicity
- Algorithms with gradient clipping for stochastic optimization with heavy-tailed noise
- Learning to optimize: a tutorial for continuous and mixed-integer optimization
- The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems
- Symplectic discretization approach for developing new proximal point algorithm
- Analyze accelerated mirror descent via high-resolution ODEs
- The operator extrapolation method for variational inequalities and its application
- Frugal and decentralised resolvent splittings defined by nonexpansive operators
- Projective splitting with backward, half-forward and proximal-Newton steps
- A distributed market-clearing framework for highly interconnected electricity and gas systems
- Baillon-bruck-Reich revisited: divergent-series parameters and strong convergence in the linear case
- A first-order algorithm for decentralised min-max problems
- Matrix-free stochastic calculation of operator norms without using adjoints
- Verification of first-order methods for parametric quadratic optimization
- Computer-assisted design of accelerated composite optimization methods: OptISTA
- A Gauss-Seidel type inertial proximal stochastic alternating direction method of multipliers for nonconvex finite sum optimization
This page was built for publication: Large-scale convex optimization. Algorithms \& analyses via monotone operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097614)
