GLOBALLY CONVERGENT ALGORITHM FOR SOLVING STATIONARY POINTS FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS VIA NONSMOOTH REFORMULATIONS.

Saved in:
Bibliographic Details
Title: GLOBALLY CONVERGENT ALGORITHM FOR SOLVING STATIONARY POINTS FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS VIA NONSMOOTH REFORMULATIONS.
Authors: LEI GUO1 lei_guo_opt@yahoo.com.cn, GUI-HUA LIN2 guihualin@shu.edu.cn
Source: Journal of Industrial & Management Optimization. Apr2013, Vol. 9 Issue 2, p305-322. 18p.
Database: Mathematics Source
Be the first to leave a comment!
You must be logged in first