Pages that link to "Item:Q2848187"
From MaRDI portal
The following pages link to An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods (Q2848187):
Displaying 50 items.
- A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis (Q255085) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems (Q2010107) (← links)
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (Q2044494) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- Accelerated proximal envelopes: application to componentwise methods (Q2116598) (← links)
- On the computational efficiency of catalyst accelerated coordinate descent (Q2117631) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
- A projection algorithm for non-monotone variational inequalities (Q2174926) (← links)
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Oracle complexity of second-order methods for smooth convex optimization (Q2330652) (← links)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- Reachability of optimal convergence rate estimates for high-order numerical convex optimization methods (Q2424400) (← links)
- Accelerated meta-algorithm for convex optimization problems (Q2656390) (← links)
- Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
- Inexact accelerated high-order proximal-point methods (Q2689812) (← links)
- On FISTA with a relative error rule (Q2696903) (← links)
- A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities (Q3449570) (← links)
- Iterative Methods for the Elastography Inverse Problem of Locating Tumors (Q4554325) (← links)
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
- A proximal-Newton method for unconstrained convex optimization in Hilbert spaces (Q4639119) (← links)
- Near-Optimal Hyperfast Second-Order Method for Convex Optimization (Q4965110) (← links)
- (Q4969259) (← links)
- Unified Acceleration of High-Order Algorithms under General Hölder Continuity (Q5003214) (← links)
- An Optimal High-Order Tensor Method for Convex Optimization (Q5026443) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods (Q5058404) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
- A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
- Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
- An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems (Q5147027) (← links)
- Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities (Q5869812) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Accelerated differential inclusion for convex optimization (Q6042222) (← links)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
- Super-Universal Regularized Newton Method (Q6136654) (← links)
- Smooth monotone stochastic variational inequalities and saddle point problems: a survey (Q6160072) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
