A Global Optimization Method using D.C. Underestimator and Convex Cut Function for General Twice-differentiable Constrained NLPs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 416
  • Download : 0
DC FieldValueLanguage
dc.contributor.author이태용-
dc.date.accessioned2013-03-18T10:57:05Z-
dc.date.available2013-03-18T10:57:05Z-
dc.date.created2012-02-06-
dc.date.issued2003-
dc.identifier.citation화학공학회, v., no., pp.1822 - 1822-
dc.identifier.urihttp://hdl.handle.net/10203/147665-
dc.languageKOR-
dc.titleA Global Optimization Method using D.C. Underestimator and Convex Cut Function for General Twice-differentiable Constrained NLPs-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage1822-
dc.citation.endingpage1822-
dc.citation.publicationname화학공학회-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthor이태용-
Appears in Collection
CBE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0