20 results for “second-order cone programming”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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.
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.
The paper proposes an inexact gradient method, PPI-GD, that improves the oracle complexity of gradient descent for smooth loss functions.
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
This paper proposes new methods for bilevel optimization in machine learning tasks.
The paper presents a parallel-in-time approach to solve computationally demanding conic optimal control problems using the alternating direction method of multipliers.
The paper presents a new method for uniform approximation of the Hölder ball using fully connected ReLU networks.
The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.
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…
This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.
This paper proposes a one-trial proximal algorithm for minimizing nonsmooth, nonconvex objectives with unknown weak-convexity parameter.
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.
Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.
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…