Pages that link to "Item:Q4177351"
From MaRDI portal
The following pages link to Optimization of lipschitz continuous functions (Q4177351):
Displaying 50 items.
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (Q273664) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Univalence and degree for Lipschitz continuous maps (Q584545) (← links)
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Nondifferential optimization via adaptive smoothing (Q1053985) (← links)
- Homeomorphisms and generalized derivatives (Q1079677) (← links)
- Reflections on nondifferentiable optimization. I: Ball gradient (Q1131956) (← links)
- Reflections on nondifferentiable optimization. II: Convergence (Q1131958) (← links)
- A minimization method for the sum of a convex function and a continuously differentiable function (Q1134011) (← links)
- Algorithms for a class of nondifferentiable problems (Q1136702) (← links)
- Hadamard's theorem for locally Lipschitzian maps (Q1163662) (← links)
- Subdifferentials of compactly Lipschitzian vector-valued functions (Q1164829) (← links)
- On the Caratheodory-John multiplier rule (Q1164846) (← links)
- Calcul sous-différentiel et optimisation (Q1256964) (← links)
- Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions (Q1321376) (← links)
- On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- Outer approximation algorithm for nondifferentiable optimization problems (Q1836591) (← links)
- Stochastic penalty function methods for nonsmooth constrained minimization (Q1918296) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study (Q2070327) (← links)
- Perturbed iterate SGD for Lipschitz continuous loss functions (Q2093279) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect (Q2252760) (← links)
- Continuous outer subdifferentials in nonsmooth optimization (Q2328202) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
- Generalized gradients and paths of descent (Q3719365) (← links)
- On directions of ∊-steepest descent for real-valued lipschitz continuous functions (Q3890429) (← links)
- (Q3923954) (← links)
- A subgradient algorithm for certain minimax and minisum problems (Q4174536) (← links)
- (Q4199843) (← links)
- ε-Subdifferential and ε-monotonicity (Q4266381) (← links)
