On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
From MaRDI portal
Publication:5210513
DOI10.1137/18M1217760zbMath1434.90148WikidataQ126413930 ScholiaQ126413930MaRDI QIDQ5210513
Publication date: 21 January 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
The ABC of DC programming, THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems, Nicely structured positive bases with maximal cosine measure, The regularized feasible directions method for nonconvex optimization, Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems, Penalty and Augmented Lagrangian Methods for Constrained DC Programming, Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A review of piecewise linearization methods
- Global optimization using interval analysis: The one-dimensional case
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Estimation of time-varying parameters in statistical models: An optimization approach
- DC programming: overview.
- On the properties of positive spanning sets and positive bases
- Computing convex hulls and counting integer points with \texttt{polymake}
- Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Modern multidimensional scaling. Theory and applications.
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Introduction to Nonlinear Optimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Clarke Subgradients of Stratifiable Functions
- Probability with Martingales
- Lectures on Polytopes
- Variational Analysis
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Nonlinear Programming
- Convex Analysis
- Theory of Positive Linear Dependence
