Image de couverture de livre

A Deterministic Algorithm of Quasi-Polynomial Complexity for Clipped Cubes Volume Approximation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Costandin, Marius
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Efficient Approximation of the Maximum Distance to A Point Over an Intersection of Balls
par: Costandin, Beniamin, et autres
Publié: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
par: Costandin, Marius
Publié: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
par: Costandin, Marius, et autres
Publié: (2023)

On a Geometric Interpretation Of the Subset Sum Problem
par: Costandin, Marius
Publié: (2024)

On Approximation Algorithms for Commutative Quaternion Polynomial Optimization
par: He, Chang, et autres
Publié: (2025)

A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization
par: Nemesch, Levin, et autres
Publié: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
par: Encz, Koppány István, et autres
Publié: (2025)

Quasi-Newton Compatible Actor-Critic for Deterministic Policies
par: Kordabad, Arash Bahari, et autres
Publié: (2025)

Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Clipping Bias and Remedies
par: Li, Qiang, et autres
Publié: (2024)

Subspace Quasi-Newton Method with Gradient Approximation
par: Miyaishi, Taisei, et autres
Publié: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
par: Agafonov, Artem, et autres
Publié: (2024)

Private and Robust Distributed Nonconvex Optimization via Polynomial Approximation
par: He, Zhiyu, et autres
Publié: (2021)

A Quasi-Newton Primal-Dual Algorithm with Line Search
par: Wang, Shida, et autres
Publié: (2024)

Frequency Stability-Constrained Unit Commitment: Tight Approximation using Bernstein Polynomials
par: Zhou, Bo, et autres
Publié: (2022)

Markovian Foundations for Quasi-Stochastic Approximation in Two Timescales: Extended Version
par: Lauand, Caio Kalil, et autres
Publié: (2024)

Clipped Stochastic Gradient Tracking For Locally Smooth Functions
par: Mei, Leilei, et autres
Publié: (2026)

Sub-sampled Trust-Region Methods with Deterministic Worst-Case Complexity Guarantees
par: Goncalves, Max L. N., et autres
Publié: (2025)

Differentially Private Clipped-SGD: High-Probability Convergence with Arbitrary Clipping Level
par: Khah, Saleh Vatan, et autres
Publié: (2025)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
par: Bhargav, Jayanth, et autres
Publié: (2024)

Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach
par: Zhong, Suhan, et autres
Publié: (2023)

High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
par: Xiong, Zikai
Publié: (2025)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
par: Sadiev, Abdurakhmon, et autres
Publié: (2025)

Analysis of a Class of Stochastic Component-Wise Soft-Clipping Schemes
par: Williamson, Måns, et autres
Publié: (2024)

Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness
par: Lobanov, Aleksandr, et autres
Publié: (2026)

A Survey of Exact and Approximation Algorithms for Linear-Parametric Optimization Problems
par: Nemesch, Levin, et autres
Publié: (2025)

Online Distributed Optimization with Clipped Stochastic Gradients: High Probability Bound of Regrets
par: Yang, Yuchen, et autres
Publié: (2024)

Convergence of Clipped SGD on Convex $(L_0,L_1)$-Smooth Functions
par: Gaash, Ofir, et autres
Publié: (2025)

A Single-Mode Quasi Riemannian Gradient Descent Algorithm for Low-Rank Tensor Recovery
par: Zhang, Yuanwei, et autres
Publié: (2024)

Linear Convergence Results for Inertial Type Projection Algorithm for Quasi-Variational Inequalities
par: Yao, Yonghong, et autres
Publié: (2024)

Inexact Regularized Quasi-Newton Algorithm for Solving Monotone Variational Inequality Problems
par: Ye, Yuge, et autres
Publié: (2025)

Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
par: Jin, Qiujiang, et autres
Publié: (2022)

Sublevel Set Approximation in The Hausdorff and Volume Metric with Application to Path Planning and Obstacle Avoidance
par: Jones, Morgan
Publié: (2023)

A Taylor-Bernstein Inner Approximation Algorithm for Path-Constrained Dynamic Optimization
par: Chang, Yuan, et autres
Publié: (2026)

A Proximal DC Algorithm for Sample Average Approximation of Chance Constrained Programming
par: Wang, Peng, et autres
Publié: (2023)

Large Deviations Analysis For Regret Minimizing Stochastic Approximation Algorithms
par: Qian, Hongjiang, et autres
Publié: (2024)

Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps
par: Housni, Omar El, et autres
Publié: (2023)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
par: Wei, Zhou, et autres
Publié: (2026)

An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise
par: Parletta, Daniela Angela, et autres
Publié: (2024)

High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise
par: Yang, Yuchen, et autres
Publié: (2025)

Computing Solutions to the Polynomial-Polynomial Regulator Problem
par: Corbin, Nicholas A., et autres
Publié: (2024)