Imagen de Portada

Marginal minimization and sup-norm expansions in perturbed optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Spokoiny, Vladimir
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Statistics Theory 90C31, 90C25, 90C15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sharp bounds in perturbed smooth optimization
por: Spokoiny, Vladimir
Publicado: (2025)

Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
por: McRae, Andrew D.
Publicado: (2024)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
por: Yan, Chen, et al.
Publicado: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
por: García-Castaño, Fernando, et al.
Publicado: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
por: García-Castaño, Fernando, et al.
Publicado: (2024)

Faster Parametric Submodular Function Minimization by Exploiting Duality
por: Gupta, Swati, et al.
Publicado: (2026)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
por: Kharitenko, Andrey, et al.
Publicado: (2025)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
por: Fujiyama, Takumi, et al.
Publicado: (2025)

Low Rank Convex Clustering For Matrix-Valued Observations
por: Lin, Meixia, et al.
Publicado: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
por: García-Castaño, Fernando, et al.
Publicado: (2025)

Chance constrained directional models in stochastic data envelopment analysis
por: Bolos, Vicente J., et al.
Publicado: (2024)

An uncertainty model for positive-valued parameters with application to robust optimization
por: Tanaka, Tatsuya, et al.
Publicado: (2026)

Multivariate approximation by polynomial and generalised rational functions
por: Millán, R. Díaz, et al.
Publicado: (2021)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
por: Guigues, Vincent, et al.
Publicado: (2017)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
por: Sakabe, Keiya
Publicado: (2026)

Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions
por: Kurtz, Jannis, et al.
Publicado: (2026)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
por: Van Tuyen, Nguyen, et al.
Publicado: (2024)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
por: Liu, Hongcheng, et al.
Publicado: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
por: Wu, Hanju, et al.
Publicado: (2025)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
por: Liang, Ling, et al.
Publicado: (2024)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
por: Lahiri, Somdeb
Publicado: (2024)

Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming
por: Chen, Liang, et al.
Publicado: (2024)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
por: Meng, Kaiwen, et al.
Publicado: (2024)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
por: Ma, Chiyu, et al.
Publicado: (2026)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
por: Geremew, W., et al.
Publicado: (2026)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
por: Marumo, Hiroki, et al.
Publicado: (2024)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
por: Papp, Dávid, et al.
Publicado: (2025)

A symmetric primal-dual algorithmic framework for saddle point problems
por: He, Hongjin, et al.
Publicado: (2022)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
por: Peng, Shen, et al.
Publicado: (2021)

Stochastic Approximation with Decision-Dependent Distributions: Asymptotic Normality and Optimality
por: Cutler, Joshua, et al.
Publicado: (2022)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
por: Song, Yongcun, et al.
Publicado: (2024)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
por: Traoré, Cheik, et al.
Publicado: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
por: Zhang, Rui-Jin, et al.
Publicado: (2025)

Properties of the complementarity set for the cone of copositive matrices
por: Kostyukova, O. I.
Publicado: (2024)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
por: Dahl, Joachim, et al.
Publicado: (2025)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
por: Tran, Trang H., et al.
Publicado: (2026)

Alternating minimization for square root principal component pursuit
por: Deng, Shengxiang, et al.
Publicado: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
por: Yang, Yaguang
Publicado: (2022)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
por: Nolasco, Eduardo, et al.
Publicado: (2025)