Optimization of lipschitz continuous functions
From MaRDI portal
Publication:4177351
DOI10.1007/BF01584320zbMath0394.90088MaRDI QIDQ4177351
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Gradients on Sets, Homeomorphisms and generalized derivatives, \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, Descent methods for composite nondifferentiable optimization problems, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Tikhonov, Ivanov and Morozov regularization for support vector machine learning, ε-Subdifferential and ε-monotonicity, Generalized gradients and paths of descent, A new trust region method for nonsmooth nonconvex optimization, Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization, Unnamed Item, A derivative-free approximate gradient sampling algorithm for finite minimax problems, ∊-gradients pour les ponctions localements lipschitziennes et applications, Stochastic penalty function methods for nonsmooth constrained minimization, A conjugate gradient sampling method for nonsmooth optimization, Reflections on nondifferentiable optimization. I: Ball gradient, Reflections on nondifferentiable optimization. II: Convergence, A minimization method for the sum of a convex function and a continuously differentiable function, On the local convergence analysis of the gradient sampling method for finite max-functions, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Algorithms for a class of nondifferentiable problems, A gradient sampling algorithm for stratified maps with applications to topological data analysis, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Nonsmooth spectral gradient methods for unconstrained optimization, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, Unnamed Item, Hadamard's theorem for locally Lipschitzian maps, Subdifferentials of compactly Lipschitzian vector-valued functions, On the Caratheodory-John multiplier rule, A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions, Unnamed Item, Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria, An SQP method for minimization of locally Lipschitz functions with nonlinear constraints, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, A Riemannian subgradient algorithm for economic dispatch with valve-point effect, Continuous approximations to generalized jacobians, Univalence and degree for Lipschitz continuous maps, An efficient descent method for locally Lipschitz multiobjective optimization problems, A subgradient algorithm for certain minimax and minisum problems, Calcul sous-différentiel et optimisation, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, On directions of ∊-steepest descent for real-valued lipschitz continuous functions, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study, A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization, Outer approximation algorithm for nondifferentiable optimization problems, Continuous outer subdifferentials in nonsmooth optimization, Optimization of upper semidifferentiable functions, Nondifferential optimization via adaptive smoothing, Perturbed iterate SGD for Lipschitz continuous loss functions, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, An adaptive gradient sampling algorithm for non-smooth optimization, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
Cites Work
- Cauchy's method of minimization
- Newton's method for convex programming and Tschebyscheff approximation
- Algorithms for some minimax problems
- Generalized Gradients and Applications
- On Steepest Descent
- Minimization of unsmooth functionals
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- Convergence rate of the gradient descent method with dilatation of the space
- Variational methods for the solution of problems of equilibrium and vibrations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
