Primal-dual first-order methods with O(1/) iteration-complexity for cone programming
From MaRDI portal
Publication:623454
Recommendations
- Primal-dual first-order methods for a class of cone programming
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Iteration-complexity of first-order penalty methods for convex programming
- First- and second-order methods for semidefinite programming
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Local minima and convergence in low-rank semidefinite programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Smooth Optimization with Approximate Gradient
- Smooth minimization of non-smooth functions
- Smoothing technique and its applications in semidefinite optimization
- Solving semidefinite-quadratic-linear programs using SDPT3
Cited in
(65)- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence
- An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- Accelerated first-order methods for a class of semidefinite programs
- Random gradient extrapolation for distributed and stochastic optimization
- A level-set method for convex optimization with a feasible solution path
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Iteration-complexity of first-order penalty methods for convex programming
- An accelerated linearized alternating direction method of multipliers
- Performance of first-order methods for smooth convex minimization: a novel approach
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Super-resolution of positive sources: the discrete setup
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- An adaptive accelerated first-order method for convex optimization
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- An optimal randomized incremental gradient method
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- Primal-dual first-order methods for a class of cone programming
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Exact gradient methods with memory
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- Polyhedral approximations in \(p\)-order cone programming
- Environmental game modeling with uncertainties
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Proportional-integral projected gradient method for conic optimization
- Accelerated gradient sliding for structured convex optimization
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Dynamic stochastic approximation for multi-stage stochastic optimization
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
- Fastest rates for stochastic mirror descent methods
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- Adaptive restart for accelerated gradient schemes
- A smoothing stochastic gradient method for composite optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Accelerated first-order methods for hyperbolic programming
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- A dual approach for optimal algorithms in distributed optimization over networks
- OSGA: a fast subgradient algorithm with optimal complexity
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
- Templates for convex cone problems with applications to sparse signal recovery
- An efficient primal dual prox method for non-smooth optimization
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Implementation of an optimal first-order method for strongly convex total variation regularization
- Algorithms for stochastic optimization with function or expectation constraints
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Smoothing proximal gradient method for general structured sparse regression
- Matrix-free convex optimization modeling
- A characterization theorem and an algorithm for a convex hull problem
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- An alternating direction method for finding Dantzig selectors
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
This page was built for publication: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623454)
