English
Related papers

Related papers: Hoffman constant of the argmin mapping in linear o…

200 papers

This paper deals with two kinds of the one-dimensional global optimization problems over a closed finite interval: (i) the objective function $f(x)$ satisfies the Lipschitz condition with a constant $L$; (ii) the first derivative of $f(x)$…

Optimization and Control · Mathematics 2013-07-15 Daniela Lera , Yaroslav D. Sergeyev

In this paper we propose third-order methods for composite convex optimization problems in which the smooth part is a three-times continuously differentiable function with Lipschitz continuous third-order derivatives. The methods are…

Optimization and Control · Mathematics 2022-02-28 Geovani Nunes Grapiglia , Yurii Nesterov

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

Optimization and Control · Mathematics 2017-10-11 Haihao Lu , Robert M. Freund , Yurii Nesterov

Non-Gaussian Harmonizable Fractional Stable Motion (HFSM) is a natural and important extension of the well-known Fractional Brownian Motion to the framework of heavy-tailed stable distributions. It was introduced several decades ago;…

Probability · Mathematics 2023-10-10 Antoine Ayache , Yimin Xiao

This paper studies large-scale optimization problems on Riemannian manifolds whose objective function is a finite sum of negative log-probability losses. Such problems arise in various machine learning and signal processing applications. By…

Optimization and Control · Mathematics 2022-07-18 Jiang Hu , Ruicheng Ao , Anthony Man-Cho So , Minghan Yang , Zaiwen Wen

This paper develops and analyzes an accelerated proximal descent method for finding stationary points of nonconvex composite optimization problems. The objective function is of the form $f+h$ where $h$ is a proper closed convex function,…

Optimization and Control · Mathematics 2024-07-02 Weiwei Kong

Estimating covariance matrices with high-dimensional complex data presents significant challenges, particularly concerning positive definiteness, sparsity, and numerical stability. Existing robust sparse estimators often fail to guarantee…

Methodology · Statistics 2025-12-30 Shaoxin Wang , Ziyun Ma

This paper is devoted to the analysis of a finite horizon discrete-time stochastic optimal control problem, in presence of constraints. We study the regularity of the value function which comes from the dynamic programming algorithm. We…

Optimization and Control · Mathematics 2007-05-23 M. Papi , S. Sbaraglia

We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…

Computational Geometry · Computer Science 2021-01-29 Paul Bendich , Peter Bubenik , Alexander Wagner

The robust statistical description of dynamical systems under perturbations is a central problem in ergodic theory. In this paper, we investigate the statistical properties of skew-product maps driven by a subshift of finite type with…

Dynamical Systems · Mathematics 2026-03-23 Davi Lima , Rafael Lucena

We study the problem of finding the nearest $\Omega$-stable matrix to a certain matrix $A$, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $\Omega$. Distances are measured in the Frobenius norm. An important…

Numerical Analysis · Mathematics 2021-02-09 Vanni Noferini , Federico Poloni

We investigate the effect of explicitly enforcing the Lipschitz continuity of neural networks with respect to their inputs. To this end, we provide a simple technique for computing an upper bound to the Lipschitz constant---for multiple…

Machine Learning · Statistics 2020-08-11 Henry Gouk , Eibe Frank , Bernhard Pfahringer , Michael J. Cree

This paper addresses the problem of estimating a convex regression function under both the sup-norm risk and the pointwise risk using B-splines. The presence of the convex constraint complicates various issues in asymptotic analysis,…

Statistics Theory · Mathematics 2012-05-02 Xiao Wang , Jinglai Shen

Composite optimization problems involve minimizing the composition of a smooth map with a convex function. Such objectives arise in numerous data science and signal processing applications, including phase retrieval, blind deconvolution,…

Optimization and Control · Mathematics 2025-10-06 Mateo Díaz , Liwei Jiang , Abdel Ghani Labassi

A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function…

Optimization and Control · Mathematics 2021-04-07 S. Bellavia , G. Gurioli , B. Morini , Ph. L. Toint

Let $(M,\omega)$ be a symplectic manifold and $U\subseteq M$ an open subset. We study the natural inclusion of the compactly supported Hamiltonian group of $U$ in the compactly supported Hamiltonian group of $M$. The main result is an upper…

Symplectic Geometry · Mathematics 2021-12-24 Michael Khanevsky , Fabian Ziltener

The ordered eigenvalues define a Lipschitz map on the real vector space of Hermitian $d \times d$ matrices. We prove that this map acts continuously, but not uniformly continuously, by superposition on the Sobolev spaces $W^{1,q}$, for all…

Functional Analysis · Mathematics 2026-03-25 Adam Parusiński , Armin Rainer

In Part 1 of this paper, we have estimated the Fr\'echet coderivative and the Mordukhovich coderivative of the stationary point set map of a smooth parametric optimization problem with one smooth functional constraint under total…

Optimization and Control · Mathematics 2018-11-15 Duong Thi Kim Huyen , Jen-Chih Yao , Nguyen Dong Yen

We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…

Optimization and Control · Mathematics 2022-07-06 Stephan Eckstein , Marcel Nutz

The optimistic gradient method has seen increasing popularity for solving convex-concave saddle point problems. To analyze its iteration complexity, a recent work [arXiv:1906.01115] proposed an interesting perspective that interprets this…

Optimization and Control · Mathematics 2024-01-11 Ruichen Jiang , Aryan Mokhtari