Pages that link to "Item:Q403634"
From MaRDI portal
The following pages link to First-order methods of smooth convex optimization with inexact oracle (Q403634):
Displaying 50 items.
- Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
- Robust hybrid zero-order optimization algorithms with acceleration via averaging in time (Q2662325) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
- A Subgradient Method for Free Material Design (Q2832891) (← links)
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints (Q3465237) (← links)
- Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← links)
- From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming (Q4571046) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion (Q4603591) (← links)
- Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- A universal modification of the linear coupling method (Q4631767) (← links)
- (Q4633055) (← links)
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression (Q4637017) (← links)
- Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems (Q4687235) (← links)
- Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems (Q4965108) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- Variable Projection for NonSmooth Problems (Q4997366) (← links)
- (Q5053256) (← links)
- Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient (Q5054156) (← links)
- Exact gradient methods with memory (Q5058416) (← links)
- A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Scheduled Restart Momentum for Accelerated Stochastic Gradient Descent (Q5094616) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems (Q5158768) (← links)
- Variable Projection for NonSmooth Problems (Q5161743) (← links)
- Generalized maximum entropy estimation (Q5214230) (← links)
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Optimal Affine-Invariant Smooth Minimization Algorithms (Q5376450) (← links)
- Accelerated Iterative Regularization via Dual Diagonal Descent (Q5853571) (← links)
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions (Q5853717) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- Universal intermediate gradient method for convex problems with inexact oracle (Q5865342) (← links)
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
- Implicit regularization with strongly convex bias: Stability and acceleration (Q5873931) (← links)
- Distributed optimization with inexact oracle (Q5878522) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- New analysis and results for the Frank-Wolfe method (Q5962717) (← links)
- An accelerated first-order method for non-convex optimization on manifolds (Q6048700) (← links)
