Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
From MaRDI portal
Publication:4441965
DOI10.1137/S105262340038256XzbMath1052.65060MaRDI QIDQ4441965
Defeng Sun, Liqun Qi, Hou-Duo Qi
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
numerical resultsvariational inequalityconstrained optimizationglobal and superlinear convergencetrust region methodKarush-Kuhn-Tucker systemstruncated conjugate gradient methodsemismouth equation
Related Items
An active set quasi-Newton method with projection step for monotone nonlinear equations ⋮ A smoothing Levenberg-Marquardt method for generalized semi-infinite programming ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Unnamed Item ⋮ A feasible decomposition method for constrained equations and its application to complementarity problems ⋮ A quasi-Newton modified LP-Newton method ⋮ Combined interior-point method and semismooth Newton method for frictionless contact problems ⋮ Trust-region method for box-constrained semismooth equations and its applications to complementary problems ⋮ Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ Boundedness and regularity properties of semismooth reformulations of variational inequalities ⋮ A self-adaptive trust region method for the extended linear complementarity problems ⋮ An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
Uses Software
