Randomized and Oracle-Based Feasible Directions Methods for Nonsmooth Nonconvex Constrained Optimization
Read the original on arXiv Machine Learning →The paper introduces feasible‑direction methods for minimizing nonsmooth, nonconvex objectives over convex sets without using derivatives. It defines η‑feasible directions to overcome the non‑closedness of the feasible direction cone at boundary points, enabling finite‑direction search even with nonlinear constraints. Two algorithmic realizations are presented: one using an η‑direction oracle and another employing a noise‑augmented randomization scheme, both achieving finite‑time approximate d‑stationarity and establishing convergence rates under curvature and Lipschitz assumptions.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.