Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem

DOI10.1080/02522667.2007.10699736zbMath1136.90028OpenAlexW2061722915MaRDI QIDQ5437797

Yan Gao

Publication date: 28 January 2008

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2007.10699736

zbMATH Keywords

nonsmooth optimizationnonsmooth equationsKKT system

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth equations approach to a constrained minimax problem.
• A simply constrained optimization reformulation of KKT systems arising from variational inequalities
• A nonsmooth version of Newton's method
• A special newton-type optimization method
• Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
• Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming

This page was built for publication: Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem