The following pages link to (Q4795311):
Displaying 18 items.
- A proximal method for composite minimization (Q304260) (← links)
- A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
- A superlinear space decomposition algorithm for constrained nonsmooth convex program (Q964944) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function (Q2190753) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
- On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition (Q2414903) (← links)
- A method for solving the system of linear equations and linear inequalities (Q2467154) (← links)
- Functions and sets of smooth substructure: relationships and examples (Q2506176) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods (Q2576738) (← links)
- Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
- Partial Smoothness and Constant Rank (Q5067431) (← links)
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
- The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)