Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints
Authors: Moraru Vasile
Keywords: nonlinear programming, KKT conditions, strict complementarity, Newton method, local superlinear convergence.
– 0.19 Mb
Keywords: nonlinear programming, KKT conditions, strict complementarity, Newton method, local superlinear convergence.
Abstract
The paper presents a reformulation of the Karush-Kuhn-Tucker (KKT) system associated nonlinear programming problem into an equivalent system of smooth equations. Classical Newton method is applied to solve the system of equations. The superlinear convergence of the primal sequence, generated by proposed method, is proved. The preliminary numerical results with a problems test set are presented.Technical University of Moldova,
Faculty of Computers, Informatics and Microelectronics
Bd. Stefan cel Mare, 168, MD-2004, Chisinau, Moldova
Phone: (373-2) 50-99-01
E-mail:
Faculty of Computers, Informatics and Microelectronics
Bd. Stefan cel Mare, 168, MD-2004, Chisinau, Moldova
Phone: (373-2) 50-99-01
E-mail:
Fulltext
– 0.19 Mb
Contents
- Concurrency specification using Event-based Specification Chart
- Concept-Oriented Model: Extending Objects with Identity, Hierarchies and Semantics
- A √(N/G) Method for Generating Communication Sets
- Coherent Route Cache In Dynamic Source Routing For Ad Hoc Networks
- Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices
- A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints
- Director of IMCS - National Prize Laureate of Moldova
