On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods

This paper studies the class of nonsmooth nonconvex problems in which the difference between a continuously differentiable function and a convex nonsmooth function is minimized over linear constrai...

[1]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[2]  P. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 1999 .

[3]  B. Mordukhovich.  Variational analysis and generalized differentiation , 2006 .

[4]  Michael Joswig,et al.  Computing convex hulls and counting integer points with polymake , 2014, 1408.4653.

[5]  R E.,et al.  Global Optimization Using Interval Analysis : The One-Dimensional Case , 2004 .

[6]  D. Avis.  A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm , 2000 .

[7]  Komei Fukuda,et al.  Lecture : Polyhedral Computation , Spring 2013 , 2013 .

[8]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[9]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[10]  Adrian S. Lewis,et al.  Clarke Subgradients of Stratifiable Functions , 2006, SIAM J. Optim..

[11]  Jack Xin,et al.  Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity , 2017, SIAM J. Optim..

[12]  Amir Beck,et al.  Convergence of an Inexact Majorization-Minimization Method for Solving a Class of Composite Optimization Problems , 2018 .

[13]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[14]  Marc Teboulle,et al.  Proximal alternating linearized method for nonconvex and nonsmooth problems , 2014 .

[15]  R. Horst,et al.  DC Programming: Overview , 1999 .

[16]  M. Kreĭn,et al.  On extreme points of regular convex sets , 1940 .

[17]  Günter M. Ziegler.  Faces of Polytopes , 1995 .

[18]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[19]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[20]  Peter Stoica,et al.  Source localization from range-difference measurements , 2006 .

[21]  Zhe Sun,et al.  Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization , 2018, Mathematical Programming.

[22]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[23]  Jong-Shi Pang,et al.  Computing B-Stationary Points of Nonsmooth DC Programs , 2015, Math. Oper. Res..

[24]  Zhi-Quan Luo,et al.  A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization , 2012, SIAM J. Optim..

[25]  Martin J. Wainwright,et al.  Convergence guarantees for a class of non-convex and non-smooth optimization problems , 2018, ICML.

[26]  Rommel G. Regis,et al.  On the properties of positive spanning sets and positive bases , 2016 .

[27]  F. Maxwell Harper,et al.  The MovieLens Datasets: History and Context , 2016, TIIS.

[28]  Dongdong Ge,et al.  A Review of Piecewise Linearization Methods , 2013 .

[29]  Chandler Davis.  THEORY OF POSITIVE LINEAR DEPENDENCE. , 1954 .