An effective nonsmooth optimization algorithm for locally Lipschitz functions
From MaRDI portal
Publication:1934631
DOI10.1007/s10957-012-0024-7zbMath1255.90113OpenAlexW2089750483MaRDI QIDQ1934631
Rohollah Yousefpour, Nezam Mahdavi-Amiri
Publication date: 29 January 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0024-7
Related Items (15)
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ A trust region method for solving linearly constrained locally Lipschitz optimization problems ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ A method for convex minimization based on translated first-order approximations ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds ⋮ A modified conjugate gradient method for general convex functions ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Computing proximal points of nonconvex functions
- Proximal point methods and nonconvex optimization
- Continuous subdifferential approximations and their applications
- Outer approximation algorithm for nondifferentiable optimization problems
- Methods of descent for nondifferentiable optimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Marginal Curvatures and Their Usefulness in the Analysis of Nonlinear Regression Models
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Finding the nearest point in A polytope
- Semismooth and Semiconvex Functions in Constrained Optimization
- Optimization of lipschitz continuous functions
- An Algorithm for Constrained Optimization with Semismooth Functions
- Pseudospectra of Linear Operators
- Finding the Point of a Polyhedron Closest to the Origin
- Robust stability and a criss-cross algorithm for pseudospectra
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Generalized Bundle Methods
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
This page was built for publication: An effective nonsmooth optimization algorithm for locally Lipschitz functions
