This paper presents a smoothing projected Newton-type method for solving the semi-infinite programming (SIP) problem. We first reformulate the KKT system of the SIP problem into a system of constrained nonsmooth equations. Then we solve this system by a smoothing projected Newton-type algorithm. ...
A Dual‐Type Method Based Algorithm for Nonlinear Large Network Optimization Problems In previous research, we have proposed a Dual Projected Pseudo Quasi Newton (DPPQN) method which differs from the conventional Lagrange relaxation method b... SY Lin,SS Lin,CH Lin - 《Asian Journal of Control》...
A projected Newton method for $\\ell \\sb p$ norm location problems. This paper is concerned with the numerical solution of continuous minisum multifacility location problems involving the $\\ell\\sb p$ norm, where $1 PH Calamai,AR Conn 被引量: 0发表: 0年 A Newton Method for Linear ...
This paper aims to develop a Newton-type method to solve a class of nonconvex composite programs. In particular, the nonsmooth part is possibly nonconvex. To tackle the nonconvexity, we develop a notion of strong prox-regularity which is related to the singleton property and Lipschitz continuity...
Convergence Rate of Incremental Gradient and Newton Methods The incremental gradient method is a prominent algorithm for minimizing a finite sum of smooth convex functions, used in many contexts including large-scal... Mert Gürbüzbalaban,Asu Ozdaglar,Pablo Parrilo - 《Siam Journal on Optimization》...
We determined the optimal translation T by minimizing the objective function using the Gauss-Newton method. The key to utilizing this method is to calculate the Jacobian. The local transformation ΔT∈SE(3)ΔT∈SE(3) was represented by a vector ξ=[θ1,θ2,θ3,ρ1,ρ2,ρ3]⊤∈se(...
Abstract In this paper, based on the alternating nonnegative least squares framework, we present a new efficient method for nonnegative matrix factorization that uses a quadratic regularization projected Barzilai–Borwein (QRPBB) method to solve the subproblems. At each iteration, the QRPBB method fi...
Obermeyer, KWinter, M
The Projected Newton method for solving inverse eigenvalue problems is extended to the case of multiple eigenvalues. It is shown that under some regularity assumptions the method converges quadratically, even if multiple eigenvalues are given. The resulting algorithm is basically the same as in case...
In their study of the classical inverse iteration algorithm, Peters and Wilkinson considered the closely related algorithm that consists of applying Newton's method, followed by a 2-norm normalization, to the nonlinear system of equations consisting of the eigenvalue-eigenvector equation and an ...