Optimization of lipschitz continuous functions
From MaRDI portal
Cites work
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- Algorithms for some minimax problems
- Cauchy's method of minimization
- Convergence rate of the gradient descent method with dilatation of the space
- Generalized Gradients and Applications
- scientific article; zbMATH DE number 3568371 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 3614520 (Why is no real title available?)
- scientific article; zbMATH DE number 3232960 (Why is no real title available?)
- scientific article; zbMATH DE number 3254433 (Why is no real title available?)
- scientific article; zbMATH DE number 3269391 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- Minimization of unsmooth functionals
- Newton's method for convex programming and Tschebyscheff approximation
- On Steepest Descent
- Theory of the integral. English translation by L. C. Young. With two additional notes by Stefan Banach
- Variational methods for the solution of problems of equilibrium and vibrations
Cited in
(75)- Nondifferential optimization via adaptive smoothing
- Homeomorphisms and generalized derivatives
- 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
- Algorithms for a class of nondifferentiable problems
- Hadamard's theorem for locally Lipschitzian maps
- Subdifferentials of compactly Lipschitzian vector-valued functions
- On the Caratheodory-John multiplier rule
- Calcul sous-différentiel et optimisation
- Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
- On the local convergence analysis of the gradient sampling method for finite max-functions
- Nonsmooth spectral gradient methods for unconstrained optimization
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A fast gradient and function sampling method for finite-max functions
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Outer approximation algorithm for nondifferentiable optimization problems
- Stochastic penalty function methods for nonsmooth constrained minimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study
- Perturbed iterate SGD for Lipschitz continuous loss functions
- A conjugate gradient sampling method for nonsmooth optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- Continuous outer subdifferentials in nonsmooth optimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
- -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- An adaptive gradient sampling algorithm for non-smooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- A new trust region method for nonsmooth nonconvex optimization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Descent methods for composite nondifferentiable optimization problems
- Generalized gradients and paths of descent
- On directions of ∊-steepest descent for real-valued lipschitz continuous functions
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A subgradient algorithm for certain minimax and minisum problems
- scientific article; zbMATH DE number 3641202 (Why is no real title available?)
- ε-Subdifferential and ε-monotonicity
- ∊-gradients pour les ponctions localements lipschitziennes et applications
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- Continuous approximations to generalized jacobians
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- 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
- Gradients on sets
- A gradient sampling method on algebraic varieties and application to nonsmooth low-rank optimization
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Univalence and degree for Lipschitz continuous maps
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
- A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
- A semismooth conjugate gradients method – theoretical analysis
- Weak convexity and approximate subdifferentials
- Derivative-free stochastic bilevel optimization for inverse problems
- Inexact zeroth-order nonsmooth and nonconvex stochastic composite optimization and applications
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
- Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization
- Goldstein stationarity in Lipschitz constrained optimization
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Distributed online optimization with edge-based event-triggered communication
- Zeroth-order gradient and quasi-Newton methods for nonsmooth nonconvex stochastic optimization
- Optimization of upper semidifferentiable functions
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
This page was built for publication: Optimization of lipschitz continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177351)
