Quasi-Self-Concordant Optimization with Lewis Weights
Fuente:
arXiv
Saved in:
| Main Authors: | Ene, Alina, Nguyen, Ta Duy, Vladu, Adrian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
by: Vladu, Adrian
Published: (2025)
by: Vladu, Adrian
Published: (2025)
Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)
by: Objois, Étienne, et al.
Published: (2025)
Solving Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Solving Positive Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2026)
by: Ene, Alina, et al.
Published: (2026)
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
by: Nguyen, Ta Duy, et al.
Published: (2024)
by: Nguyen, Ta Duy, et al.
Published: (2024)
On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)
by: Apers, Simon, et al.
Published: (2024)
Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)
by: Chen, Jiale, et al.
Published: (2023)
Adaptive Power Iteration Method for Differentially Private PCA
by: Nguyen, Ta Duy, et al.
Published: (2026)
by: Nguyen, Ta Duy, et al.
Published: (2026)
The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)
by: Zhang, Qiao, et al.
Published: (2024)
Optimization in Sanger Sequencing
by: Carpente, Luisa, et al.
Published: (2024)
by: Carpente, Luisa, et al.
Published: (2024)
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)
by: Brubaker, Kyle, et al.
Published: (2025)
Submodular Order Functions and Assortment Optimization
by: Udwani, Rajan
Published: (2021)
by: Udwani, Rajan
Published: (2021)
Isotropic Noise in Stochastic and Quantum Convex Optimization
by: Marsden, Annie, et al.
Published: (2025)
by: Marsden, Annie, et al.
Published: (2025)
Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)
by: Carmon, Yair, et al.
Published: (2024)
Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)
by: Adil, Deeksha, et al.
Published: (2025)
Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)
by: Bok, Jinho, et al.
Published: (2025)
Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
by: Chang, Claire, et al.
Published: (2026)
by: Chang, Claire, et al.
Published: (2026)
Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)
by: Chen, Li, et al.
Published: (2025)
Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
by: Nerem, Robert R., et al.
Published: (2024)
by: Nerem, Robert R., et al.
Published: (2024)
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
by: Housni, Omar El, et al.
Published: (2024)
by: Housni, Omar El, et al.
Published: (2024)
When Location Shapes Choice: Placement Optimization of Substitutable Products
by: Housni, Omar El, et al.
Published: (2023)
by: Housni, Omar El, et al.
Published: (2023)
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)
by: Sun, Shuo, et al.
Published: (2024)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)
by: Su, Yuexin, et al.
Published: (2026)
Optimizing Line Segment Inspection with Limited-Range Drones
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)
Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
by: Das, Priyam
Published: (2016)
by: Das, Priyam
Published: (2016)
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)
by: Hunkenschröder, Christoph, et al.
Published: (2025)
Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)
by: Klimm, Max, et al.
Published: (2025)
Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)
by: Jambulapati, Arun, et al.
Published: (2025)
Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)
by: Xie, Fangzhou
Published: (2025)
ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)
by: Ma, Zihang
Published: (2025)
A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)
by: Anapolska, Mariia, et al.
Published: (2025)
An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)
by: Bhandari, Swastik
Published: (2025)
Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)
by: Segev, Danny, et al.
Published: (2025)
Robust Gittins for Stochastic Scheduling
by: Moseley, Benjamin, et al.
Published: (2025)
by: Moseley, Benjamin, et al.
Published: (2025)
Is Zadeh's Least-Entered Pivot Rule Exponential?
by: Zadeh, Norman
Published: (2025)
by: Zadeh, Norman
Published: (2025)
3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)
by: Rohwedder, Lars, et al.
Published: (2025)
Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)
by: Encz, Koppány István, et al.
Published: (2025)
An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)
by: Blankenburg, Daniel, et al.
Published: (2025)
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)
by: Segev, Danny
Published: (2025)
Similar Items
-
Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025) -
Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
by: Vladu, Adrian
Published: (2025) -
Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025) -
Solving Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2025) -
Solving Positive Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2026)