A general class of penalty/barrier path-following Newton methods for nonlinear programming Export

@article{citeulike:156507, author = {Grossmann, C. and Zadlo, M.}, citeulike-article-id = {156507}, citeulike-linkout-0 = {http://dx.doi.org/10.1080/02331930412331326310}, citeulike-linkout-1 = {http://www.ingentaconnect.com/content/tandf/gopt/2005/00000054/00000002/art00004}, doi = {10.1080/02331930412331326310}, issn = {0233-1934}, journal = {Optimization}, keywords = {constrained, gradient, optimization, penalty}, month = {April}, number = {2}, pages = {161--190}, posted-at = {2007-05-09 10:37:38}, priority = {3}, publisher = {Taylor and Francis Ltd}, title = {A general class of penalty/barrier path-following Newton methods for nonlinear programming}, url = {http://dx.doi.org/10.1080/02331930412331326310}, volume = {54}, year = {2005} }

TY - JOUR ID - citeulike:156507 L3 - citeulike-article-id:156507 IS - 2 JF - Optimization SN - 0233-1934 EP - 190 TI - A general class of penalty/barrier path-following Newton methods for nonlinear programming PB - Taylor and Francis Ltd VL - 54 SP - 161 KW - constrained KW - gradient KW - optimization KW - penalty AU - Grossmann, C AU - Zadlo, M PY - 2005/04// UR - http://dx.doi.org/10.1080/02331930412331326310 ER -