Imagen de Portada

Accelerated first-order methods for a class of semidefinite programs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Alex L., Kilinc-Karzan, Fatma
Formato:	Preprint
Publicado:	2022
Materias:	Optimization and Control Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On semidefinite descriptions for convex hulls of quadratic programs
por: Wang, Alex L., et al.
Publicado: (2024)

Parameterized algorithms for block-structured integer programs with large entries
por: Cslovjecsek, Jana, et al.
Publicado: (2023)

Accelerating Proximal Gradient Descent via Silver Stepsizes
por: Bok, Jinho, et al.
Publicado: (2024)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
por: Altschuler, Jason M., et al.
Publicado: (2026)

Optimized methods for composite optimization: a reduction perspective
por: Bok, Jinho, et al.
Publicado: (2025)

Quantum speedups for linear programming via interior point methods
por: Apers, Simon, et al.
Publicado: (2023)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
por: Adil, Deeksha, et al.
Publicado: (2024)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
por: Chen, Li, et al.
Publicado: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2023)

Interior point methods are not worse than Simplex
por: Allamigeon, Xavier, et al.
Publicado: (2022)

Online Decision Making with Fairness over Time
por: Chen, Rui, et al.
Publicado: (2022)

Reusing Samples in Variance Reduction
por: Jin, Yujia, et al.
Publicado: (2025)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
por: Nerem, Robert R., et al.
Publicado: (2024)

Distributionally Robust Newsvendor on a Metric
por: Foussoul, Ayoub, et al.
Publicado: (2024)

Solving the Probabilistic Profitable Tour Problem on a Tree
por: Angelelli, Enrico, et al.
Publicado: (2022)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
por: Jin, Billy, et al.
Publicado: (2022)

A nearly optimal randomized algorithm for explorable heap selection
por: Borst, Sander, et al.
Publicado: (2022)

Fair Assortment Planning
por: Chen, Qinyi, et al.
Publicado: (2022)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
por: Kasperski, Adam, et al.
Publicado: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

Radial Isotropic Position via an Implicit Newton's Method
por: Jambulapati, Arun, et al.
Publicado: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
por: Adil, Deeksha, et al.
Publicado: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

Coordinating Spot and Contract Supply in Freight Marketplaces
por: Kaminsky, Philip, et al.
Publicado: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

Labeling Methods for Partially Ordered Paths
por: Euler, Ricardo, et al.
Publicado: (2023)

Sparse Submodular Function Minimization
por: Graur, Andrei, et al.
Publicado: (2023)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
por: Sergeev, Ivan
Publicado: (2024)

ALNS for Tugboat Scheduling in Inland Waterway
por: Ma, Zihang
Publicado: (2025)

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
por: Cole, Richard, et al.
Publicado: (2023)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
por: Anapolska, Mariia, et al.
Publicado: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
por: Objois, Étienne, et al.
Publicado: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
por: Ales, Zacharie, et al.
Publicado: (2024)