The following pages link to (Q3809587):
Displaying 35 items.
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods (Q511970) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An accelerated inexact proximal point algorithm for convex minimization (Q1937079) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning (Q2073715) (← links)
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization (Q2142534) (← links)
- Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
- Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
- Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis (Q2311982) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- Credible autocoding of convex optimization algorithms (Q2358081) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- On FISTA with a relative error rule (Q2696903) (← links)
- Iterative Proportional Scaling Revisited: A Modern Optimization Perspective (Q3391182) (← links)
- (Q4637041) (← links)
- Group Regularized Estimation Under Structural Hierarchy (Q4690971) (← links)
- Exact gradient methods with memory (Q5058416) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- Convergence rates of gradient methods for convex optimization in the space of measures (Q6114893) (← links)
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
- On mathematical modeling in image reconstruction and beyond (Q6200218) (← links)
