| Record ID | marc_columbia/Columbia-extract-20221130-012.mrc:158292049:1993 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-012.mrc:158292049:1993?format=raw |
LEADER: 01993pam a22003614a 4500
001 5712780
005 20221121203112.0
008 050421t20062006nyua b 001 0 eng
010 $a 2005042696
020 $a0387249753 (alk. paper)
024 3 $a9780387249759
035 $a(OCoLC)ocm60311926
035 $a(NNC)5712780
035 $a5712780
040 $aDLC$cDLC$dBAKER$dC#P$dOHX$dIXA$dOrLoB-B
042 $apcc
050 00 $aT57.8$b.S86 2006
082 00 $a519.7/6$222
100 1 $aSun, Wenyu.$0http://id.loc.gov/authorities/names/n83045643
245 10 $aOptimization theory and methods :$bnonlinear programming /$cby Wenyu Sun, Ya-xiang Yuan.
260 $aNew York :$bSpringer,$c[2006], ©2006.
300 $axii, 687 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aSpringer optimization and its applications ;$vv. 1
504 $aIncludes bibliographical references (p. [649]-681) and index.
505 00 $g1.$tIntroduction -- $g2.$tLine search -- $g3.$tNewton's methods -- $g4.$tConjugate gradient method -- $g5.$tQuasi-Newton methods -- $g6.$tTrust-region and conic model methods -- $g7.$tNonlinear least-squares problems -- $g8.$tTheory of constrained optimization -- $g9.$tQuadratic programming -- $g10.$tPenalty function methods -- $g11.$tFeasible direction methods -- $g12.$tSequential quadratic programming -- $g13.$tTR methods for constrained problems -- $g14.$tNonsmooth optimization.
650 0 $aNonlinear programming.$0http://id.loc.gov/authorities/subjects/sh85092331
650 0 $aMathematical optimization.$0http://id.loc.gov/authorities/subjects/sh85082127
700 1 $aYuan, Ya-xiang.$0http://id.loc.gov/authorities/names/n98021017
830 0 $aSpringer optimization and its applications ;$vv. 1.$0http://id.loc.gov/authorities/names/no2006059964
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0663/2005042696-d.html
852 00 $bsci$hT57.8$i.S86 2006