SearcharxivSearch

arXiv subjects

Rui Diao

Publications and source records attributed to Rui Diao.

3 recordsLinked to original sources

Counterexamples for BFGS-type methods under arbitrary strong Wolfe constants

Whether the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and its variants can fail to converge on smooth nonconvex functions under realistic line-search parameters has remained a central open problem in quasi-Newton theory since the landmark counterexample of Dai (2002), which was confined to small Armijo parameters ($c_1 \le 1/84 \approx 0.0119$ on Powell's geometry, or $c_1 \le 69/7480 \approx 0.0092$ on his six-point cycle) and an objective function unbounded below. In this paper, we resolve the long-standing open question, posed by Dai (2002) following a discussion with J. C. Gilbert, of whether such counterexamples exist in theory for every Armijo parameter $c_1 \in (0, 1)$. Specifically, for every prescribed pair of line-search parameters $0 < c_1 < c_2 < 1$, we construct an objective function $f \in C^\infty(\mathbb{R}^2)$, bounded below and with Lipschitz continuous gradient, on which every method in a broad conjugacy class $\mathcal{C}$ equipped with the first-local-minimizer line search generates an infinite sequence of iterates with $\|\nabla f(x_k)\| = 1$ for all $k \ge 0$. The class $\mathcal{C}$ encompasses the classical full-memory BFGS method, limited-memory BFGS (L-BFGS) with arbitrary memory $m \ge 1$, the Broyden positive family, and the Hestenes-Stiefel conjugate gradient method. The steps are the standard first local minimizers along the search rays and simultaneously satisfy the strong Wolfe, weak Wolfe, Armijo, and Goldstein conditions with constants $(c_1, c_2)$. The construction operates in the minimal possible dimension $n = 2$, exploiting a non-decaying conjugate descent orbit in the plane coupled with an explicit tubular interpolation whose two-bump axial curvature profile places the Armijo ratio anywhere in $(0, 1)$.

math.OC

A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\left\{[a_{i,1},a_{i,2}]\right\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target $T$ but cannot exceed it. In this paper, we first study the computational complexity of the ISSP. We show that the ISSP is relatively easy to solve compared to the 0-1 Knapsack problem (KP). We also identify several subclasses of the ISSP which are polynomial time solvable (with high probability), albeit the problem is generally NP-hard. Then, we propose a new fully polynomial time approximation scheme (FPTAS) for solving the general ISSP problem. The time and space complexities of the proposed scheme are ${\cal O}\left(n \max\left\{1 / \epsilon,\log n\right\}\right)$ and ${\cal O}\left(n+1/\epsilon\right),$ respectively, where $\epsilon$ is the relative approximation error. To the best of our knowledge, the proposed scheme has almost the same time complexity but a significantly lower space complexity compared to the best known scheme. Both the correctness and efficiency of the proposed scheme are validated by numerical simulations. In particular, the proposed scheme successfully solves ISSP instances with $n=100,000$ and $\epsilon=0.1\%$ within one second.

cs.DS

An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions

In this paper, we consider the problem of computing the smallest enclosing ball (SEB) of a set of $m$ balls in $\mathbb{R}^n,$ where the product $mn$ is large. We first approximate the non-differentiable SEB problem by its log-exponential aggregation function and then propose a computationally efficient inexact Newton-CG algorithm for the smoothing approximation problem by exploiting its special (approximate) sparsity structure. The key difference between the proposed inexact Newton-CG algorithm and the classical Newton-CG algorithm is that the gradient and the Hessian-vector product are inexactly computed in the proposed algorithm, which makes it capable of solving the large-scale SEB problem. We give an adaptive criterion of inexactly computing the gradient/Hessian and establish global convergence of the proposed algorithm. We illustrate the efficiency of the proposed algorithm by using the classical Newton-CG algorithm as well as the algorithm from [Zhou. {et al.} in Comput. Opt. \& Appl. 30, 147--160 (2005)] as benchmarks.

math.OC