Pages that link to "Item:Q1934631"
From MaRDI portal
The following pages link to An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631):
Displayed 15 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)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- A modified conjugate gradient method for general convex functions (Q2699981) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- A trust region method for solving linearly constrained locally Lipschitz optimization problems (Q4559395) (← links)
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds (Q4609464) (← links)
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- A new nonmonotone line search method for nonsmooth nonconvex optimization (Q6198510) (← links)