Search

In recent years, accelerated extra-gradient methods have attracted much attention by researchers, for solving monotone inclusion problems. A limitation of most current accelerated extra-gradient methods lies in their direct utilization of the initial point, which can potentially decelerate numerical convergence rate. In this work, we present a new accelerated extra-gradient method, by utilizing the symplectic acceleration technique. We establish the inverse of quadratic convergence rate by employing the Lyapunov function technique. Also, we demonstrate a faster inverse of quadratic convergence rate alongside its weak convergence property under stronger assumptions. To improve practical efficiency, we introduce a line search technique for our symplectic extra-gradient method. Theoretically, we prove the convergence of the symplectic extra-gradient method with line search. Numerical tests show that this adaptation exhibits faster convergence rates in practice compared to several existing extra-gradient type methods., Comment: 37 pages, 7 figures, 1 table

Bilevel reinforcement learning (RL), which features intertwined two-level problems, has attracted growing interest recently. The inherent non-convexity of the lower-level RL problem is, however, to be an impediment to developing bilevel optimization methods. By employing the fixed point equation associated with the regularized RL, we characterize the hyper-gradient via fully first-order information, thus circumventing the assumption of lower-level convexity. This, remarkably, distinguishes our development of hyper-gradient from the general AID-based bilevel frameworks since we take advantage of the specific structure of RL problems. Moreover, we propose both model-based and model-free bilevel reinforcement learning algorithms, facilitated by access to the fully first-order hyper-gradient. Both algorithms are provable to enjoy the convergence rate $\mathcal{O}(\epsilon^{-1})$. To the best of our knowledge, this is the first time that AID-based bilevel RL gets rid of additional assumptions on the lower-level problem. In addition, numerical experiments demonstrate that the hyper-gradient indeed serves as an integration of exploitation and exploration., Comment: 43 pages, 1 figure, 1 table

Bilevel optimization, with broad applications in machine learning, has an intricate hierarchical structure. Gradient-based methods have emerged as a common approach to large-scale bilevel problems. However, the computation of the hyper-gradient, which involves a Hessian inverse vector product, confines the efficiency and is regarded as a bottleneck. To circumvent the inverse, we construct a sequence of low-dimensional approximate Krylov subspaces with the aid of the Lanczos process. As a result, the constructed subspace is able to dynamically and incrementally approximate the Hessian inverse vector product with less effort and thus leads to a favorable estimate of the hyper-gradient. Moreover, we propose a~provable subspace-based framework for bilevel problems where one central step is to solve a small-size tridiagonal linear system. To the best of our knowledge, this is the first time that subspace techniques are incorporated into bilevel optimization. This successful trial not only enjoys $\mathcal{O}(\epsilon^{-1})$ convergence rate but also demonstrates efficiency in a synthetic problem and two deep learning tasks., Comment: 35 pages, 11 figures, 1 table

In this study, we investigate the electronic structure of a spin-triplet superconductor candidate CeRh$_2$As$_2$ using high-resolution angle-resolved photoemission spectroscopy and density functional theory calculations. Notably, Fermi surface nesting hints at connections to magnetic excitation or quadrupole density wave phenomena, elucidating the superconducting mechanisms. Measured band structures reveal primarily localized 4f electrons, with minor itinerant contributions. Additionally, a transition from localized to itinerant behavior and significant c-f hybridization anisotropy underscore the role of f-electrons in shaping electronic properties. These findings deepen our understanding of CeRh$_2$As$_2$'s unconventional superconductivity and magnetism. Further exploration promises advances in superconductivity research., Comment: 6 pages, 3 figures

In this study, ultrafast optical spectroscopy was employed to elucidate the intricate topological features of EuIn$_2$As$_2$, a promising candidate for a magnetic topological-crystalline axion insulator. Our investigation, focusing on the real-time evolution of topological states, unveiled a narrow surface magnetic gap (2$\Delta_0$ $\simeq$ 8.2 meV)) emerging at the antiferromagnetic transition temperature ($T_N$ $\approx$ 16 K). Below $T_N$, two extremely low-energy collective modes, $\omega_1$ and $\omega_2$, with frequencies of $\sim$9.9 and 21.6 GHz at $T$ = 4 K, respectively, were observed, exhibiting strong temperature dependence. $\omega_1$ correlates with an acoustic phonon, while $\omega_2$ is associated with a magnon. The results suggest that EuIn$_2$As$_2$ has the potential to manifest a magnetic topological-crystalline axion insulator, presenting a small magnetic energy gap on the (001) surface. The findings further our understanding of the interplay between magnetism and topology in this material, showcasing its potential for applications in quantum information processing and spintronics., Comment: 6 pages, 4 figures

We investigate the antiferromagnetic heavy fermion superconductor UPd$_2$Al$_3$, employing angle-resolved photoemission spectroscopy to unravel the complex electronic structure of its U 5f electrons. We observe unexpected characteristics that challenge the conventional temperature-dependent behavior of heavy fermion systems, revealing unexpected characteristics. At temperatures above the anticipated coherence temperature (T$^*$), we observe itinerant U 5f electrons at temperatures higher than previously postulated. Additionally, a previously unidentified dispersionless band emerges around 600 meV below the Fermi energy, potentially linked to spin-orbit splitting within the U 5f states. Hybridization between the 5f electrons and conduction band was observed with an energy dispersion of 10 meV at low temperatures, suggesting that U 5f electrons near and at the Fermi surface have an itinerant nature. Temperature-dependent 5d-5f resonance spectra reveal that the 5f electron spectrum weight increases with lowering temperature and begins to decrease at temperatures significantly higher than the Neel temperature (T$_N$). We further show that the competition between the Kondo effect and Ruderman-Kittel-Kasuya-Yosida (RKKY) interactions may be responsible for the relocalization of 5f electrons, making relocalization a precursor to the establishment of magnetic order at lower temperatures. Our experiments also provide evidence that 5f electrons with the same orbital are involved in both the Kondo effect and RKKY interactions, suggesting that the two coexist at lower temperatures., Comment: 6 pages, 4 figures

In the realm of tensor optimization, the low-rank Tucker decomposition is crucial for reducing the number of parameters and for saving storage. We explore the geometry of Tucker tensor varieties -- the set of tensors with bounded Tucker rank -- which is notably more intricate than the well-explored matrix varieties. We give an explicit parametrization of the tangent cone of Tucker tensor varieties and leverage its geometry to develop provable gradient-related line-search methods for optimization on Tucker tensor varieties. To the best of our knowledge, this is the first work concerning geometry and optimization on Tucker tensor varieties. In practice, low-rank tensor optimization suffers from the difficulty of choosing a reliable rank parameter. To this end, we incorporate the established geometry and propose a Tucker rank-adaptive method that aims to identify an appropriate rank with guaranteed convergence. Numerical experiments on tensor completion reveal that the proposed methods are in favor of recovering performance over other state-of-the-art methods. The rank-adaptive method performs the best across various rank parameter selections and is indeed able to find an appropriate rank., Comment: 50 pages, 16 figures, 1 table

Synchrotron-based angle-resolved photoemission spectroscopy was employed to investigate the temperature evolution of the Yb 4f spectral for surface and bulk in the Kondo lattice YbCu$_2$Si$_2$.Our study quantitatively distinguishes between the surface and bulk hybridization processes, revealing that the onset temperatures for both surface and bulk hybridization processes are significantly higher than the Kondo temperature. Additionally, we found that the effective surface Kondo temperature is much lower than that of the bulk. These findings offer valuable insights into the understanding of heavy fermion physics., Comment: 7 pages, 4 figures

We consider the linear conic optimization problem with the cone of nonnegative polynomials. Its dual optimization problem is the generalized moment problem. Moment-SOS relaxations are powerful for solving them. This paper studies finite convergence of the Moment-SOS hierarchy when the constraining set is defined by equations whose ideal may not be real radical. Under the archimedeanness, we show that the Moment-SOS hierarchy has finite convergence if some classical optimality conditions hold at every minimizer of the optimal nonnegative polynomial for the linear conic optimization problem. When the archimedeanness fails (this is the case for unbounded sets), we propose a homogenized Moment-SOS hierarchy and prove its finite convergence under similar assumptions. Furthermore, we also prove the finite convergence of the Moment-SOS hierarchy with denominators. In particular, this paper resolves a conjecture posed in the earlier work.

This paper proposes the method 2D-MoSub (2-dimensional model-based subspace method), which is a novel derivative-free optimization (DFO) method based on the subspace method for general unconstrained optimization and especially aims to solve large-scale DFO problems. Our method combines 2-dimensional quadratic interpolation models and trust-region techniques to iteratively update the points and explore the 2-dimensional subspace. Its framework includes initialization, constructing the interpolation set, building the quadratic interpolation model, performing trust-region trial steps, and updating the trust-region radius and subspace. We introduce the framework and computational details of 2D-MoSub, and discuss the poisedness and quality of the interpolation set in the corresponding 2-dimensional subspace. We also analyze some properties of our method, including the model's approximation error with projection property and the algorithm's convergence. Numerical results demonstrate the effectiveness and efficiency of 2D-MoSub for solving a variety of unconstrained optimization problems., Comment: 21 pages

Proximal point algorithms have found numerous applications in the field of convex optimization, and their accelerated forms have also been proposed. However, the most commonly used accelerated proximal point algorithm was first introduced in 1967, and recent studies on accelerating proximal point algorithms are relatively scarce. In this paper, we propose high-resolution ODEs for the proximal point operators for both closed proper convex functions and maximally monotone operators, and present a Lyapunov function framework to demonstrate that the trajectories of our high-resolution ODEs exhibit accelerated behavior. Subsequently, by symplectically discretizing our high-resolution ODEs, we obtain new proximal point algorithms known as symplectic proximal point algorithms. By decomposing the continuous-time Lyapunov function into its elementary components, we demonstrate that symplectic proximal point algorithms possess $O(1/k^2)$ convergence rates.

Mirror descent plays a crucial role in constrained optimization and acceleration schemes, along with its corresponding low-resolution ordinary differential equations (ODEs) framework have been proposed. However, the low-resolution ODEs are unable to distinguish between Polyak's heavy-ball method and Nesterov's accelerated gradient method. This problem also arises with accelerated mirror descent. To address this issue, we derive high-resolution ODEs for accelerated mirror descent and propose a general Lyapunov function framework to analyze its convergence rate in both continuous and discrete time. Furthermore, we demonstrate that accelerated mirror descent can minimize the squared gradient norm at an inverse cubic rate.

We study in this paper the function approximation error of multivariate linear extrapolation. While the sharp error bound of linear interpolation already exists in the literature, linear extrapolation is used far more often in applications such as derivative-free optimization, and its error is not well-studied. A method to numerically compute the sharp error bound is introduced, and several analytical bounds are presented along with the conditions under which they are sharp. The approximation error achievable by quadratic functions and the error bound for the bivariate case are analyzed in depth. Additionally, we provide the convergence theories regarding the simplex derivative-free optimization method as a demonstration of the utility of the derived bounds. All results are under the assumptions that the function being interpolated has Lipschitz continuous gradient and is interpolated on an affinely independent sample set., Comment: 28 pages, 5 figures. arXiv admin note: text overlap with arXiv:2209.12606

A significant milestone in modern gradient-based optimization was achieved with the development of Nesterov's accelerated gradient descent (NAG) method. This forward-backward technique has been further advanced with the introduction of its proximal generalization, commonly known as the fast iterative shrinkage-thresholding algorithm (FISTA), which enjoys widespread application in image science and engineering. Nonetheless, it remains unclear whether both NAG and FISTA exhibit linear convergence for strongly convex functions. Remarkably, these algorithms demonstrate convergence without requiring any prior knowledge of strongly convex modulus, and this intriguing characteristic has been acknowledged as an open problem in the comprehensive review [Chambolle and Pock, 2016, Appendix B]. In this paper, we address this question by utilizing the high-resolution ordinary differential equation (ODE) framework. Expanding upon the established phase-space representation, we emphasize the distinctive approach employed in crafting the Lyapunov function, which involves a dynamically adapting coefficient of kinetic energy that evolves throughout the iterations. Furthermore, we highlight that the linear convergence of both NAG and FISTA is independent of the parameter $r$. Additionally, we demonstrate that the square of the proximal subgradient norm likewise advances towards linear convergence., Comment: 17 pages, 3 figures; To appear in SIAM Journal on Optimization

Since optimization on Riemannian manifolds relies on the chosen metric, it is appealing to know that how the performance of a Riemannian optimization method varies with different metrics and how to exquisitely construct a metric such that a method can be accelerated. To this end, we propose a general framework for optimization problems on product manifolds where the search space is endowed with a preconditioned metric, and we develop the Riemannian gradient descent and Riemannian conjugate gradient methods under this metric. Specifically, the metric is constructed by an operator that aims to approximate the diagonal blocks of the Riemannian Hessian of the cost function, which has a preconditioning effect. We explain the relationship between the proposed methods and the variable metric methods, and show that various existing methods, e.g., the Riemannian Gauss--Newton method, can be interpreted by the proposed framework with specific metrics. In addition, we tailor new preconditioned metrics and adapt the proposed Riemannian methods to the canonical correlation analysis and the truncated singular value decomposition problems, and we propose the Gauss--Newton method to solve the tensor ring completion problem. Numerical results among these applications verify that a delicate metric does accelerate the Riemannian optimization methods., Comment: 33 pages, 8 figures, 4 tables

We reported the quasiparticle relaxation dynamics of an optimally doped triclinic iron-based superconductor (Ca$_{0.85}$La$_{0.15}$)$_{10}$(Pt$_3$As$_8$)(Fe$_2$As$_2$)$_5$ with bulk $T_c$ = 30 K using polarized ultrafast optical pump-probe spectroscopy. Our results reveal anisotropic transient reflectivity induced by nematic fluctuations develops below $T_{nem}$ $\approx$ 120 K and persists in the superconducting states. Measurements under high pump fluence reveal three distinct, coherent phonon modes at frequencies of 1.6, 3.5, and 4.7 THz, corresponding to $A_{1g}(1)$, $E_g$, and $A_{1g}(2)$ modes, respectively. The high-frequency $A_{1g}(2)$ mode corresponds to the $c$-axis polarized vibrations of FeAs planes with a nominal electron-phonon coupling constant $\lambda _{A_{1g}(2)}$ $\approx$ 0.139 $\pm$ 0.02. Our findings suggest that the superconductivity and nematic state are compatible but competitive at low temperatures, and the $A_{1g}$ phonons play an important role in the formation of Cooper pairs in (Ca$_{0.85}$La$_{0.15}$)$_{10}$(Pt$_3$As$_8$)(Fe$_2$As$_2$)$_5$., Comment: 6 pages, 3 figures and Supplemental Materials

The three-dimensional electronic structure and the nature of Ce 4f electrons of the Kondo insulator CeRu4Sn6 are investigated by angle-resolved photoemission spectroscopy, utilizing tunable photon energies. Our results reveal (i) the three-dimensional k-space nature of the Fermi surface, (ii) the localized-to-itinerant transition of f electrons occurs at a much high temperature than the hybridization gap opening temperature, and (iii) the "relocalization" of itinerant f electrons below 25 K, which could be the precursor to the establishment of magnetic order., Comment: 6 pages, 4 figures

The high-resolution differential equation framework has been proven to be tailor-made for Nesterov's accelerated gradient descent method~(\texttt{NAG}) and its proximal correspondence -- the class of faster iterative shrinkage thresholding algorithms (FISTA). However, the systems of theories is not still complete, since the underdamped case ($r < 2$) has not been included. In this paper, based on the high-resolution differential equation framework, we construct the new Lyapunov functions for the underdamped case, which is motivated by the power of the time $t^{\gamma}$ or the iteration $k^{\gamma}$ in the mixed term. When the momentum parameter $r$ is $2$, the new Lyapunov functions are identical to the previous ones. These new proofs do not only include the convergence rate of the objective value previously obtained according to the low-resolution differential equation framework but also characterize the convergence rate of the minimal gradient norm square. All the convergence rates obtained for the underdamped case are continuously dependent on the parameter $r$. In addition, it is observed that the high-resolution differential equation approximately simulates the convergence behavior of~\texttt{NAG} for the critical case $r=-1$, while the low-resolution differential equation degenerates to the conservative Newton's equation. The high-resolution differential equation framework also theoretically characterizes the convergence rates, which are consistent with that obtained for the underdamped case with $r=-1$., Comment: 21 pages, 4 figures, 2 tables

We investigated the electronic structure of the antiferromagnetic Kondo lattice CePd5Al2 using high-resolution angle-resolved photoemission spectroscopy. The experimentally determined band structure of the conduction electrons is predominated by the Pd 4d character. It contains multiple hole and electron Fermi pockets, in good agreement with density functional theory calculations. The Fermi surface is folded over Q0 = (0, 0, 1), manifested by Fermi surface reconstruction and band folding. Our results suggest that Fermi surface nesting drives the formation of antiferromagnetic order in CePd5Al2., Comment: 6 pages,3 figure

We propose Riemannian preconditioned algorithms for the tensor completion problem via tensor ring decomposition. A new Riemannian metric is developed on the product space of the mode-2 unfolding matrices of the core tensors in tensor ring decomposition. The construction of this metric aims to approximate the Hessian of the cost function by its diagonal blocks, paving the way for various Riemannian optimization methods. Specifically, we propose the Riemannian gradient descent and Riemannian conjugate gradient algorithms. We prove that both algorithms globally converge to a stationary point. In the implementation, we exploit the tensor structure and adopt an economical procedure to avoid large matrix formulation and computation in gradients, which significantly reduces the computational cost. Numerical experiments on various synthetic and real-world datasets -- movie ratings, hyperspectral images, and high-dimensional functions -- suggest that the proposed algorithms are more efficient and have better reconstruction ability than other candidates., Comment: 25 pages, 7 figures, 5 tables

Derivative-free optimization problems are optimization problems where derivative information is unavailable. The least Frobenius norm updating quadratic interpolation model function is one of the essential under-determined model functions for model-based derivative-free trust-region methods. This article proposes derivative-free optimization with transformed objective functions and gives a trust-region method with the least Frobenius norm model. The model updating formula is based on Powell's formula. The method shares the same framework with those for problems without transformations, and its query scheme is given. We propose the definitions related to optimality-preserving transformations to understand the interpolation model in our method. We prove the existence of model optimality-preserving transformations beyond translation transformation. The necessary and sufficient condition for such transformations is given. The affine transformation with a positive multiplication coefficient is not model optimality-preserving. We also analyze the corresponding least Frobenius norm updating model and its interpolation error when the objective function is affinely transformed. Convergence property of a provable algorithmic framework containing our model is given. Numerical results of solving test problems and a real-world problem with the implementation NEWUOA-Trans show that our method can successfully solve most problems with objective optimality-preserving transformations, even though such transformations will change the optimality of the model function. To our best knowledge, this is the first work providing the model-based derivative-free algorithm and analysis for transformed problems with the function evaluation oracle (not the function-value comparison oracle). This article also proposes the "moving-target" optimization problem., Comment: 42 pages, Derivative-Free Optimization with Transformed Objective Functions (DFOTO) and the Algorithm Based on the Least Frobenius Norm Updating Quadratic Model

Derivative-free optimization methods are numerical methods for optimization problems in which no derivative information is used. Such optimization problems are widely seen in many real applications. One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. In this paper, we propose a new way to update the quadratic model by minimizing the $H^2$ norm of the difference between neighbouring quadratic models. Motivation for applying the $H^2$ norm is given, and theoretical properties of our new updating technique are also presented. Projection in the sense of $H^2$ norm and interpolation error analysis of our model function are proposed. We obtain the coefficients of the quadratic model function by using the KKT conditions. Numerical results show advantages of our model, and the derivative-free algorithms based on our least $H^2$ norm updating quadratic model functions can solve test problems with fewer function evaluations than algorithms based on least Frobenius norm updating., Comment: 24 pages

In this paper, we revisit the class of iterative shrinkage-thresholding algorithms (ISTA) for solving the linear inverse problem with sparse representation, which arises in signal and image processing. It is shown in the numerical experiment to deblur an image that the convergence behavior in the logarithmic-scale ordinate tends to be linear instead of logarithmic, approximating to be flat. Making meticulous observations, we find that the previous assumption for the smooth part to be convex weakens the least-square model. Specifically, assuming the smooth part to be strongly convex is more reasonable for the least-square model, even though the image matrix is probably ill-conditioned. Furthermore, we improve the pivotal inequality tighter for composite optimization with the smooth part to be strongly convex instead of general convex, which is first found in [Li et al., 2022]. Based on this pivotal inequality, we generalize the linear convergence to composite optimization in both the objective value and the squared proximal subgradient norm. Meanwhile, we set a simple ill-conditioned matrix which is easy to compute the singular values instead of the original blur matrix. The new numerical experiment shows the proximal generalization of Nesterov's accelerated gradient descent (NAG) for the strongly convex function has a faster linear convergence rate than ISTA. Based on the tighter pivotal inequality, we also generalize the faster linear convergence rate to composite optimization, in both the objective value and the squared proximal subgradient norm, by taking advantage of the well-constructed Lyapunov function with a slight modification and the phase-space representation based on the high-resolution differential equation framework from the implicit-velocity scheme., Comment: 16 pages, 4 figures

Nesterov's accelerated gradient descent (NAG) is one of the milestones in the history of first-order algorithms. It was not successfully uncovered until the high-resolution differential equation framework was proposed in [Shi et al., 2022] that the mechanism behind the acceleration phenomenon is due to the gradient correction term. To deepen our understanding of the high-resolution differential equation framework on the convergence rate, we continue to investigate NAG for the $\mu$-strongly convex function based on the techniques of Lyapunov analysis and phase-space representation in this paper. First, we revisit the proof from the gradient-correction scheme. Similar to [Chen et al., 2022], the straightforward calculation simplifies the proof extremely and enlarges the step size to $s=1/L$ with minor modification. Meanwhile, the way of constructing Lyapunov functions is principled. Furthermore, we also investigate NAG from the implicit-velocity scheme. Due to the difference in the velocity iterates, we find that the Lyapunov function is constructed from the implicit-velocity scheme without the additional term and the calculation of iterative difference becomes simpler. Together with the optimal step size obtained, the high-resolution differential equation framework from the implicit-velocity scheme of NAG is perfect and outperforms the gradient-correction scheme., Comment: 17 pages

For first-order smooth optimization, the research on the acceleration phenomenon has a long-time history. Until recently, the mechanism leading to acceleration was not successfully uncovered by the gradient correction term and its equivalent implicit-velocity form. Furthermore, based on the high-resolution differential equation framework with the corresponding emerging techniques, phase-space representation and Lyapunov function, the squared gradient norm of Nesterov's accelerated gradient descent (\texttt{NAG}) method at an inverse cubic rate is discovered. However, this result cannot be directly generalized to composite optimization widely used in practice, e.g., the linear inverse problem with sparse representation. In this paper, we meticulously observe a pivotal inequality used in composite optimization about the step size $s$ and the Lipschitz constant $L$ and find that it can be improved tighter. We apply the tighter inequality discovered in the well-constructed Lyapunov function and then obtain the proximal subgradient norm minimization by the phase-space representation, regardless of gradient-correction or implicit-velocity. Furthermore, we demonstrate that the squared proximal subgradient norm for the class of iterative shrinkage-thresholding algorithms (ISTA) converges at an inverse square rate, and the squared proximal subgradient norm for the class of faster iterative shrinkage-thresholding algorithms (FISTA) is accelerated to convergence at an inverse cubic rate., Comment: 17 pages, 4 figures

We study in this paper the function approximation error of linear interpolation and extrapolation. Several upper bounds are presented along with the conditions under which they are sharp. All results are under the assumptions that the function has Lipschitz continuous gradient and is interpolated on an affinely independent sample set. Errors for quadratic functions and errors of bivariate linear extrapolation are analyzed in depth., Comment: 18 pages, 3 figures

Ultrafast optical spectroscopy was used to investigate the ultrafast quasiparticle dynamics of antiferromagnetic Kondo lattice CeAuSb$_2$ as a function of temperature and fluence. Our results reveal (i) the opening of a narrow hybridization gap ($\Delta$ $\sim$ 4.5 meV) near the Fermi level below the coherence temperature $T^*$ $\approx$ 100 K, (ii) the coupling of coherent phonon modes with Kondo effect and magnetic orders, leading to the frequencies anomaly at the characteristic temperatures, and (iii) a possible photoinduced nonthermal phase transition. Our observations thus shed light on the hybridization dynamics and magnetic orders in heavy fermion systems., Comment: 6 pages with 4 figures

In the history of first-order algorithms, Nesterov's accelerated gradient descent (NAG) is one of the milestones. However, the cause of the acceleration has been a mystery for a long time. It has not been revealed with the existence of gradient correction until the high-resolution differential equation framework proposed in [Shi et al., 2021]. In this paper, we continue to investigate the acceleration phenomenon. First, we provide a significantly simplified proof based on precise observation and a tighter inequality for $L$-smooth functions. Then, a new implicit-velocity high-resolution differential equation framework, as well as the corresponding implicit-velocity version of phase-space representation and Lyapunov function, is proposed to investigate the convergence behavior of the iterative sequence $\{x_k\}_{k=0}^{\infty}$ of NAG. Furthermore, from two kinds of phase-space representations, we find that the role played by gradient correction is equivalent to that by velocity included implicitly in the gradient, where the only difference comes from the iterative sequence $\{y_{k}\}_{k=0}^{\infty}$ replaced by $\{x_k\}_{k=0}^{\infty}$. Finally, for the open question of whether the gradient norm minimization of NAG has a faster rate $o(1/k^3)$, we figure out a positive answer with its proof. Meanwhile, a faster rate of objective value minimization $o(1/k^2)$ is shown for the case $r > 2$., Comment: 16 pages

This paper studies generalized truncated moment problems with unbounded sets. First, we study geometric properties of the truncated moment cone and its dual cone of nonnegative polynomials. By the technique of homogenization, we give a convergent hierarchy of Moment-SOS relaxations for approximating these cones. With them, we give a Moment-SOS method for solving generalized truncated moment problems with unbounded sets. Finitely atomic representing measures, or certificates for their nonexistence, can be obtained by the proposed method. Numerical experiments and applications are also given.

Layered tellurides have been extensively studied as a platform for investigating the Fermi surface (FS) nesting-driven charge density wave (CDW) states. EuTe4, one of quasi-two-dimensional (quasi-2D) binary rare-earth tetratellurides CDW compounds, with unconventional hysteretic transition, is currently receiving much attention. Here, the CDW modulation vector, momentum and temperature dependence of CDW gaps in EuTe4 are investigated using angle-resolved photoemission spectroscopy. Our results reveal that (i) a FS nesting vector q ~ 0.67 b* drives the formation of CDW state, (ii) a large anisotropic CDW gap is fully open in the whole FS, and maintains a considerable size even at 300 K, leading to appearance of semiconductor properties, (iii) an abnormal non-monotonic increase of CDW gap in magnitude as a function of temperature, (iv) an extra, larger gap opens at a higher binding energy due to the interaction between the different orbits of the main bands., Comment: 5 pages, 4 figures

The newly discovered ternary chalcogenide superconductor Bi$_2$Rh$_3$Se$_2$ has attracted growing attention, which provides an opportunity to explore the interplay between charge density wave (CDW) order and superconductivity. However, whether the phase transition at 240 K can be attributed to CDW formation remains controversial. To help resolve the debate, we study the electronic structure study of Bi2Rh3Se2 by angle-resolved photoemission spectroscopy experiments, with emphasis on the nature of its high-temperature phase transition at 240 K. Our measurements demonstrate that the phase transition at 240 K is a second-order CDW phase transition. Our results reveal (i) a 2 x 2 CDW order in Bi$_2$Rh$_3$Se$_2$, accompanied by the reconstruction of electronic structure, such as band folding, band splitting, and opening of CDW gaps at and away from Fermi level; (ii) the existence of electron-phonon coupling, which is manifested as an obvious kink and peak-dip-hump structure in dispersion; and (iii) the appearance of a flat band. Our observations thus enable us to shed light on the nature of the CDW order and its interplay with superconductivity in Bi$_2$Rh$_3$Se$_2$., Comment: 5 pages, 5 figures

This paper considers polynomial optimization with unbounded sets. We give a homogenization formulation and propose a hierarchy of Moment-SOS relaxations to solve it. Under the assumptions that the feasible set is closed at infinity and the ideal of homogenized equality constraining polynomials is real radical, we show that this hierarchy of Moment-SOS relaxations has finite convergence, if some optimality conditions (i.e., the linear independence constraint qualification, strict complementarity and second order sufficiency conditions) hold at every minimizer, including the one at infinity. Moreover, we prove extended versions of Putinar-Vasilescu type Positivstellensatz for polynomials that are nonnegative on unbounded sets. The classical Moment-SOS hierarchy with denominators is also studied. In particular, we give a positive answer to a conjecture of Mai, Lasserre and Magron in their recent work.

We use ultrafast optical spectroscopy to study the nonequilibrium quasiparticle relaxation dynamics of the iron-based superconductor KCa$_2$Fe$_4$As$_4$F$_2$ with $T_c=33.5$ K. Our results reveal a possible pseudogap ($\Delta_{PG}$ = 2.4 $\pm$ 0.1 meV) below $T^*\approx 50$ K but prior to the opening of a superconducting gap ($\Delta_{SC}$(0) $\approx$ 4.3 $\pm$ 0.1 meV). Measurements under high pump fluence real two distinct, coherent phonon oscillations with 1.95 and 5.51 THz frequencies, respectively. The high-frequency $A_{1g}$(2) mode corresponds to the $c-$axis polarized vibrations of FeAs planes with a nominal electron-phonon coupling constant $\lambda_{A_{1g}(2)}$ = 0.194 $\pm$ 0.02. Our findings suggest that the pseudogap is likely a precursor of superconductivity, and the electron-phonon coupling may play an essential role in the superconducting pairing in KCa$_2$Fe$_4$As$_4$F$_2$., Comment: 6 pages, 3 figure

We systemically investigate the nature of Ce 4f electrons in structurally layered heavy-fermion compounds CcmMnIn3m+2n (with M =Co, Rh, Ir, and Pt, m=l, 2, n=0 - 2), at low temperature using on-resonance angle-resolved photoemission spectroscopy. Three heavy quasiparticle bands f^0, f^1_7/2 and f^1_5/2 are observed in all compounds, but their intensities and energy locations vary greatly with materials. The strong f^0 states imply that the localized electron behavior dominates the Ce 4f states. The Ce 4f electrons are partially hybridized with the conduction electrons, making them have the dual nature of localization and itinerant. Our quantitative comparison reveals that the f^1_5/2 / f^0 intensity ratio is more suitable to reflect the 4f-state hybridization strength., Comment: 7 pages, 4 figures