A globally and quadratically convergent algorithm for general nonlinear programming problems

Publisher Website

1 June 1981

journal article
Published by Springer Nature in Computing

Vol. 26 (2) , 141-153
https://doi.org/10.1007/bf02241780

Abstract

No abstract available

Keywords

PENALTY ALGORITHMS. EIN GLOBAL UND QUADRATISCH KONVERGENTER ALGORITHMUS FIIR ALLGEMEINE NICHTLINEARE OPTIMIEMNGSPROBLEME. VORL~IUFIGE NUMERISCHE ERGEBNISSE WERDEN BERICHTET.
65 K05. KEY WORDS: NONLINEAR PROGRAMMING ALGORITHMS
PRELIMINARY COMPUTATIONAL RESULTS ARE PRESENTED. AMS MOS SUBJECT CLASSIFICATIONS: 90 C30

This publication has 6 references indexed in Scilit:

Nonlinear Programming for Large, Sparse Systems
Published by Defense Technical Information Center (DTIC) ,1976
A class of accelerated conjugate direction methods for linearly constrained minimization problems
Mathematics of Computation, 1976
A computational comparison of some non-linear programs
Mathematical Programming, 1973
A superlinearly convergent method for minimization problems with linear inequality constraints
Mathematical Programming, 1973
A quadratically-convergent algorithm for general nonlinear programming problems
Mathematical Programming, 1972
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Mathematical Programming, 1971