The regularized feasible directions method for nonconvex optimization
From MaRDI portal
Recommendations
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 1538127 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization
- 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
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- First-order methods in optimization
- Generating all vertices of a polyhedron is hard
- Introduction to Derivative-Free Optimization
- Introductory lectures on convex optimization. A basic course.
- Lectures on Polytopes
- Nonlinear Programming
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- On the properties of positive spanning sets and positive bases
- Theory of Positive Linear Dependence
Cited in
(5)- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- New characterizations of exact regularization of non-convex programs
- A generalization of the norm-relaxed method of feasible directions
- A feasible directions method for nonsmooth convex optimization
This page was built for publication: The regularized feasible directions method for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084025)
