On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
Sign Up to like & getrecommendations! Published in 2023 at "Inverse Problems"
DOI: 10.1088/1361-6420/acca43
Abstract: In this paper we propose a new algorithm for solving a class of nonsmooth nonconvex problems, which is obtained by combining the iteratively reweighted scheme with a finite number of forward–backward iterations based on a… read more here.
Keywords: linesearch based; iteratively reweighted; based algorithm; nonconvex composite ... See more keywords
Issues on a 2-Dimensional Quadratic Sub-Problem and Its Applications in Nonlinear Programming: Trust-Region Methods (TRMs) and Linesearch Based Methods (LBMs)
Sign Up to like & getrecommendations! Published in 2024 at "Algorithms"
DOI: 10.3390/a17120563
Abstract: This paper analyses the solution of a specific quadratic sub-problem, along with its possible applications, within both constrained and unconstrained Nonlinear Programming frameworks. We give evidence that this sub–problem may appear in a number of… read more here.
Keywords: problem; sub problem; quadratic sub; sub ... See more keywords