arXiv subjects

Hongpeng Sun

Publications and source records attributed to Hongpeng Sun.

At least 19 recordsLinked to original sources

arXiv2026

A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation

The paper proposes a novel proximal difference-of-convex (DC) algorithmic framework to solve general non-convex, non-smooth optimization problems. By combining Barzilai-Borwein (BB) step sizes with nonmonotone line search strategies, our approach effectively overcomes the conservative step sizes and stability issues inherent in standard proximal DC algorithms. Furthermore, we develop extrapolation mechanisms to accelerate convergence while ensuring global stability. The global convergence of the proposed algorithms is rigorously established under the Kurdyka-\L ojasiewicz property. Numerical experiments on the SCAD-regularized least squares problem and graphic Ginzburg-Landau image segmentation models demonstrate that the proposed methods achieve highly competitive efficiency and accuracy compared to existing DC algorithms.

math.OC↗

arXiv2025

A preconditioned second-order convex splitting algorithm with extrapolation

Nonconvex optimization problems are widespread in modern machine learning and data science. We introduce an extrapolation strategy into a class of preconditioned second-order convex splitting algorithms for nonconvex optimization problems. The proposed algorithms combine second-order backward differentiation formulas (BDF2) with an extrapolation method. Meanwhile, the implicit-explicit scheme simplifies the subproblem through a preconditioned process. As a result, our approach solves nonconvex problems efficiently without significant computational overhead. Theoretical analysis establishes global convergence of the algorithms using Kurdyka-\L ojasiewicz properties. Numerical experiments include a benchmark problem, the least squares problem with SCAD regularization, and an image segmentation problem. These results demonstrate that our algorithms are highly efficient, as they achieve reduced solution times and competitive performance.

math.OC↗

arXiv2025

An Augmented Lagrangian Method-Based Framework in the Adjoint Space for Sparse Reconstruction of Acoustic Sources

We propose a semismooth Newton-based augmented Lagrangian framework for reconstructing sparse sources in inverse acoustic scattering problems. Rather than working in the unknown source space, our semismooth Newton updates operate in the measurement (adjoint) space, which is especially efficient when the number of measurements is much smaller than the discretized source dimension. The source is then recovered via Fenchel-Rockafellar duality. Our approach substantially accelerates computation and reduces costs. Numerical experiments in two and three dimensions demonstrate the high efficiency of the proposed method.

math.NA↗

arXiv2025

A preconditioned third-order implicit-explicit algorithm with a difference of varying convex functions and extrapolation

This paper proposes a novel preconditioned implicit-explicit algorithm enhanced with the extrapolation technique for non-convex optimization problems. The algorithm employs a third-order Adams-Bashforth scheme for the nonlinear and explicit parts and a third-order backward differentiation formula for the implicit part of the gradient flow in variational functions. The proposed algorithm, akin to a generalized difference-of-convex (DC) approach, employs a changing set of convex functions in each iteration. Under the Kurdyka-\L ojasiewicz (KL) properties, the global convergence of the algorithm is guaranteed, ensuring that it converges within a finite number of preconditioned iterations. Our numerical experiments, including least squares problems with SCAD regularization and the graphical Ginzburg-Landau model, demonstrate the proposed algorithm's highly efficient performance compared to conventional DC algorithms.

math.OC↗

arXiv2025

A preconditioned difference of convex functions algorithm with extrapolation and line search

This paper proposes a novel proximal difference-of-convex (DC) algorithm enhanced with extrapolation and aggressive non-monotone line search for solving non-convex optimization problems. We introduce an adaptive conservative update strategy of the extrapolation parameter determined by a computationally efficient non-monotone line search. The core of our algorithm is to unite the update of the extrapolation parameter with the step size of the non-monotone line search interactively. The global convergence of the two proposed algorithms is established through the Kurdyka-{\L}ojasiewicz properties, ensuring convergence within a preconditioned framework for linear equations. Numerical experiments on two general non-convex problems: SCAD-penalized binary classification and graph-based Ginzburg-Landau image segmentation models, demonstrate the proposed method's high efficiency compared to existing DC algorithms both in convergence rate and solution accuracy.

math.OC↗

arXiv2024

A boosted second-order convex splitting algorithm based on gradient flows

This paper introduces a second-order convex splitting scheme for gradient flows arising in phase-field models, based on the backward differentiation formula (BDF2) for the implicit part and the Adams-Bashforth method for the nonlinear and explicit component. The method is formulated and analyzed in finite-dimensional spaces, where energy stability plays a central role in establishing rigorous convergence properties. By leveraging the Kurdyka-\L ojasiewicz framework, we prove the global convergence of the discrete trajectories generated by the scheme, even in the presence of nonsmooth energy functionals, under mild assumptions on the time-step size. The Armijo line search strategy and the classical preconditioning strategies, such as symmetric Gauss-Seidel and Jacobi, are incorporated to improve its computational efficiency. Numerical experiments confirm that the proposed method achieves computational efficiency compared to existing first-order splitting approaches and other accelerated splitting algorithms, while maintaining robustness in both smooth and nonsmooth regimes.

math.OC↗

arXiv2023

Preconditioned Algorithm for Difference of Convex Functions with applications to Graph Ginzburg-Landau Model

In this work, we propose and study a preconditioned framework with a graphic Ginzburg-Landau functional for image segmentation and data clustering by parallel computing. Solving nonlocal models is usually challenging due to the huge computation burden. For the nonconvex and nonlocal variational functional, we propose several damped Jacobi and generalized Richardson preconditioners for the large-scale linear systems within a difference of convex functions algorithms framework. They are efficient for parallel computing with GPU and can leverage the computational cost. Our framework also provides flexible step sizes with a global convergence guarantee. Numerical experiments show the proposed algorithms are very competitive compared to the singular value decomposition based spectral method.

math.NA↗

arXiv2022

A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems

In this article, we propose and study a stochastic and relaxed preconditioned Douglas--Rachford splitting method to solve saddle-point problems that have separable dual variables. We prove the almost sure convergence of the iteration sequences in Hilbert spaces for a class of convex-concave and nonsmooth saddle-point problems. We also provide the sublinear convergence rate for the ergodic sequence concerning the expectation of the restricted primal-dual gap functions. Numerical experiments show the high efficiency of the proposed stochastic and relaxed preconditioned Douglas--Rachford splitting methods.

math.OC↗

arXiv2022

An Efficient Augmented Lagrangian Method with Semismooth Newton Solver for Total Generalized Variation

Total generalization variation (TGV) is a very powerful and important regularization for various inverse problems and computer vision tasks. In this paper, we proposed a semismooth Newton based augmented Lagrangian method to solve this problem. The augmented Lagrangian method (also called as method of multipliers) is widely used for lots of smooth or nonsmooth variational problems. However, its efficiency usually heavily depends on solving the coupled and nonlinear system together and simultaneously, which is very complicated and highly coupled for total generalization variation. With efficient primal-dual semismooth Newton methods for the complicated linear subproblems involving total generalized variation, we investigated a highly efficient and competitive algorithm compared to some efficient first-order method. With the analysis of the metric subregularities of the corresponding functions, we give both the global convergence and local linear convergence rate for the proposed augmented Lagrangian methods.

math.OC↗

arXiv2021

Variational Image Motion Estimation by Accelerated Dual Optimization

Estimating optical flows is one of the most interesting problems in computer vision, which estimates the essential information about pixel-wise displacements between two consecutive images. This work introduces an efficient dual optimization framework with accelerated preconditioners to the challenging nonsmooth optimization problem of total-variation regularized optical-flow estimation. In theory, the proposed dual optimization framework brings an elegant variational analysis on the given difficult optimization problem, while presenting an efficient algorithmic scheme without directly tackling the corresponding nonsmoothness in numeric. By introducing efficient preconditioners with a multi-scale implementation, the proposed accelerated dual optimization approaches achieve competitive estimation results of image motion, comparing to the state-of-the-art methods. Moreover, we show that the proposed preconditioners can guarantee convergence of the implemented numerical schemes with high efficiency.

math.OC↗

arXiv2021

An Investigation on Semismooth Newton based Augmented Lagrangian Method for Image Restoration

Augmented Lagrangian method (also called as method of multipliers) is an important and powerful optimization method for lots of smooth or nonsmooth variational problems in modern signal processing, imaging, optimal control and so on. However, one usually needs to solve the coupled and nonlinear system together and simultaneously, which is very challenging. In this paper, we proposed several semismooth Newton methods to solve the nonlinear subproblems arising in image restoration, which leads to several highly efficient and competitive algorithms for imaging processing. With the analysis of the metric subregularities of the corresponding functions, we give both the global convergence and local linear convergence rate for the proposed augmented Lagrangian methods with semismooth Newton solvers.

math.OC↗

arXiv2021

A Preconditioned Alternating Minimization Framework for Nonconvex and Half Quadratic Optimization

For some typical and widely used non-convex half-quadratic regularization models and the Ambrosio-Tortorelli approximate Mumford-Shah model, based on the Kurdyka-Łojasiewicz analysis and the recent nonconvex proximal algorithms, we developed an efficient preconditioned framework aiming at the linear subproblems that appeared in the nonlinear alternating minimization procedure. Solving large-scale linear subproblems is always important and challenging for lots of alternating minimization algorithms. By cooperating the efficient and classical preconditioned iterations into the nonlinear and nonconvex optimization, we prove that only one or any finite times preconditioned iterations are needed for the linear subproblems without controlling the error as the usual inexact solvers. The proposed preconditioned framework can provide great flexibility and efficiency for dealing with linear subproblems and guarantee the global convergence of the nonlinear alternating minimization method simultaneously.

math.OC↗

arXiv2021

Dualization and Automatic Distributed Parameter Selection of Total Generalized Variation via Bilevel Optimization

Total Generalized Variation (TGV) regularization in image reconstruction relies on an infimal convolution type combination of generalized first- and second-order derivatives. This helps to avoid the staircasing effect of Total Variation (TV) regularization, while still preserving sharp contrasts in images. The associated regularization effect crucially hinges on two parameters whose proper adjustment represents a challenging task. In this work, a bilevel optimization framework with a suitable statistics-based upper level objective is proposed in order to automatically select these parameters. The framework allows for spatially varying parameters, thus enabling better recovery in high-detail image areas. A rigorous dualization framework is established, and for the numerical solution, two Newton type methods for the solution of the lower level problem, i.e. the image reconstruction problem, and two bilevel TGV algorithms are introduced, respectively. Denoising tests confirm that automatically selected distributed regularization parameters lead in general to improved reconstructions when compared to results for scalar parameters.

math.OC↗

arXiv2021

A Preconditioned Difference of Convex Algorithm for Truncated Quadratic Regularization with Application to Imaging

We consider the minimization problem with the truncated quadratic regularization with gradient operator, which is a nonsmooth and nonconvex problem. We cooperated the classical preconditioned iterations for linear equations into the nonlinear difference of convex functions algorithms with extrapolation. Especially, our preconditioned framework can deal with the large linear system efficiently which is usually expensive for computations. Global convergence is guaranteed and local linear convergence rate is given based on the analysis of the Kurdyka-Łojasiewicz exponent of the minimization functional. The proposed algorithm with preconditioners turns out to be very efficient for image restoration and is also appealing for image segmentation.

math.OC↗

arXiv2020

Efficient ADMM and Splitting Methods for Continuous Min-cut and Max-flow Problems

The Potts model has many applications. It is equivalent to some min-cut and max-flow models. Primal-dual algorithms have been used to solve these problems. Due to the special structure of the models, convergence proof is still a difficult problem. In this work, we developed two novel, preconditioned, and over-relaxed alternating direction methods of multipliers (ADMM) with convergence guarantee for these models. Using the proposed preconditioners or block preconditioners, we get accelerations with the over-relaxation variants of preconditioned ADMM. The preconditioned and over-relaxed Douglas-Rachford splitting methods are also considered for the Potts model. Our framework can handle both the two-labeling or multi-labeling problems with appropriate block preconditioners based on Eckstein-Bertsekas and Fortin-Glowinski splitting techniques.

math.OC↗

arXiv2019

Sparse Reconstructions of Acoustic Source for Inverse Scattering Problems in Measure Space

This paper proposes a systematic mathematical analysis of both the direct and inverse acoustic scattering problem given the source in Radon measure space. For the direct problem, we investigate the well-posedness including the existence, the uniqueness, and the stability by introducing a special definition of the weak solution, i.e. \emph{very} weak solution. For the inverse problem, we choose the Radon measure space instead of the popular $L^1$ space to build the sparse reconstruction, which can guarantee the existence of the reconstructed solution. The sparse reconstruction problem can be solved by the semismooth Newton method in the dual space. Numerical examples are included.

math.AP↗

arXiv2017

Analysis of Fully Preconditioned ADMM with Relaxation in Hilbert Spaces

Alternating direction method of multipliers (ADMM) is a powerful first order methods for various applications in signal processing and imaging. However, there is no clear result on the weak convergence of ADMM with relaxation studied by Eckstein and Bertsakas \cite{EP} in infinite dimensional Hilbert spaces. In this paper, by employing a kind of "partial" gap analysis, we prove the weak convergence of general preconditioned and relaxed ADMM in infinite dimensional Hilbert spaces, with preconditioning for solving all the involved implicit equations under mild conditions. We also give the corresponding ergodic convergence rates respecting to the "partial" gap function. Furthermore, the connections between certain preconditioned and relaxed ADMM and the corresponding Douglas-Rachford splitting methods are also discussed, following the idea of Gabay in \cite{DGBA}. Numerical tests also show the efficiency of the proposed overrelaxation variants of preconditioned ADMM.

math.OC↗

arXiv2017

On a gesture-computing technique using electromagnetic waves

This paper is concerned with a conceptual gesture-based instruction/input technique using electromagnetic wave detection. The gestures are modelled as the shapes of some impenetrable or penetrable scatterers from a certain admissible class, called a dictionary. The gesture-computing device generates time-harmonic electromagnetic point signals for the gesture recognition and detection. It then collects the scattered wave in a relatively small backscattering aperture on a bounded surface containing the point sources. The recognition algorithm consists of two stages and requires only two incident waves of different wavenumbers. The location of the scatterer is first determined approximately by using the measured data at a small wavenumber and the shape of the scatterer is then identified using the computed location of the scatterer and the measured data at a regular wavenumber. We provide the corresponding mathematical principle with rigorous analysis. Numerical experiments show that the proposed device works effectively and efficiently.

math.AP↗