Pages that link to "Item:Q4603043"
From MaRDI portal
The following pages link to Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043):
Displaying 50 items.
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
- Quartic first-order methods for low-rank minimization (Q2031993) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
- Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
- Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems (Q2157903) (← links)
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- Golden ratio algorithms for variational inequalities (Q2205983) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
- Finitely determined functions (Q2656197) (← links)
- Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
- Numerical methods for some classes of variational inequalities with relatively strongly monotone operators (Q2680746) (← links)
- Affine-invariant contracting-point methods for convex optimization (Q2687041) (← links)
- Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
- Inexact accelerated high-order proximal-point methods (Q2689812) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- Bregman three-operator splitting methods (Q2696977) (← links)
- Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems (Q4965108) (← links)
- Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
- Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure (Q5013580) (← links)
- An Optimal High-Order Tensor Method for Convex Optimization (Q5026443) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- Inexact basic tensor methods for some classes of convex optimization problems (Q5043845) (← links)
- Gradient methods with memory (Q5043847) (← links)
- Exact gradient methods with memory (Q5058416) (← links)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation (Q5071108) (← links)
- Continuous-Time Convergence Rates in Potential and Monotone Games (Q5081641) (← links)
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- (Q5095420) (← links)
- Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
