Pages that link to "Item:Q5210513"
From MaRDI portal
The following pages link to On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513):
Displaying 12 items.
- The ABC of DC programming (Q829493) (← links)
- The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- (Q3154671) (← links)
- Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems (Q5003218) (← links)
- THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE (Q5102214) (← links)
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs (Q5868963) (← links)
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems (Q6114895) (← links)
- Nicely structured positive bases with maximal cosine measure (Q6164951) (← links)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization (Q6624429) (← links)
