-

 

 

 




Optimization Online





 

Global Optimization Submissions - 2001

October 2001

Theory
New Classes of Globally Convexized Filled Functions for Global Optimization
Stefano Lucidi, Veronica Piccialli


December 2001

Theory
Semidefinite programming vs LP relaxations for polynomial programming
Jean B. Lasserre

A sequential convexification method (SCM) for continuous global optimization
Wenxing Zhu


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society