ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “second-order cone programming”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
math.OCcs.LGTheoreticalRecentJun 26, 2026

Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization

Shuang Li, Zhihui Zhu, Qiuwei Li

This paper analyzes Bregman ADMM for nonconvex linearly constrained problems under two-sided relative smoothness, showing convergence to strict saddle points and almost-sure second-order stationarity.

View →
cs.DScs.LGTheoreticalRecentAug 3, 2026

The Condition-Number Barrier in Sparse Least Squares

Honghao Lin, Vahab Mirrokni, David P. Woodruff

The paper establishes a lower bound for the improvement of linear dependence on the restricted condition number in sparse convex optimization, using the Small-Set Expansion Hypothesis.

View →
cs.LGmath.OCstat.MLEmpiricalRecentJun 18, 2026

On the Oracle Complexity of Interpolation-Based Gradient Descent

Dongmin Lee, William Lu, Anuran Makur

The paper proposes an inexact gradient method, PPI-GD, that improves the oracle complexity of gradient descent for smooth loss functions.

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
math.OCcs.LGEmpiricalRecentOct 19, 2026

Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity

Youran Dong, Junfeng Yang, Wei Yao, Jin Zhang

This paper proposes new methods for bilevel optimization in machine learning tasks.

View →
math.OCcs.ROEmpiricalRecentJun 23, 2026

Parallel Dynamic Programming for Conic Linear Quadratic Control

Luyao Zhang, Gabriel Bravo-Palacios, Brian Plancher, Sergio Grammatico

The paper presents a parallel-in-time approach to solve computationally demanding conic optimal control problems using the alternating direction method of multipliers.

View →
stat.MLcs.LGmath.NATheoreticalRecentOct 15, 2026

Optimal approximation of smooth functions by ReLU neural networks

Thomas Nagler

The paper presents a new method for uniform approximation of the Hölder ball using fully connected ReLU networks.

View →
math.OCcs.DSTheoreticalRecentJun 10, 2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, László A. Végh, Giacomo Zambelli

The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.

View →
cs.DScs.CCcs.GTTheoreticalRecentJul 28, 2026

A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →
math.OCcs.DSTheoreticalRecentJun 15, 2026

Adaptive Proximal Methods for Weakly Convex Optimization with Unknown Parameter: Deterministic and Stochastic Guarantees

Miaolan Xie

This paper proposes a one-trial proximal algorithm for minimizing nonsmooth, nonconvex objectives with unknown weak-convexity parameter.

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View →
cs.CCcs.GTcs.LGTheoreticalRecentJun 15, 2026

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.

View →
cs.LGmath.OCstat.MLTheoreticalRecentJul 20, 2026

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

Haichen Hu, David Simchi-Levi

This paper shows that stochastic nonconvex optimization can be reduced to ordinary static regret minimization in online convex optimization, and establishes convergence rates for smooth and Lipschitz…

View →