会议专题

Decomposition Methods for Computing D-stationary Point

Outline:·A general nonconvex framework with minus max structure ·Two motivating problems ·Nonconvex group sparsity representation;·Generalized noncooperative potential game;·d-(Directional derivative based) stationarity·Algorithms for computing d-stationarity·Deterministic algorithm·Randomized algorithm·Summary

Min Tao

Department of Mathematics,Nanjing University

国内会议

中国运筹学会第十四次学术年会

重庆

英文

1-31

2018-10-12(万方平台首次上网日期,不代表论文的发表时间)