Optimization of upper semidifferentiable functions
From MaRDI portal
Publication:790713
DOI10.1007/BF00938396zbMath0534.90069OpenAlexW1980252045MaRDI QIDQ790713
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00938396
convergence analysisgeneralized gradientgeneralized Wolfe's algorithmMifflin's algorithmnonconvex, nondifferentiable functionupper semidifferentiable functions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Continuity and differentiation questions (26B05)
Related Items (24)
Comparing different nonsmooth minimization methods and software ⋮ ε-Subdifferential and ε-monotonicity ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ Descent methods for quasidifferentiable minimization ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ ∊-gradients pour les ponctions localements lipschitziennes et applications ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization ⋮ Globally convergent variable metric method for convex nonsmooth unconstrained minimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ An algorithm for minimizing a class of locally Lipschitz functions ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Cites Work
- On the variational principle
- Algorithms for some minimax problems
- Generalized Gradients and Applications
- Optimization of lipschitz continuous functions
- An Algorithm for Constrained Optimization with Semismooth Functions
- A New Approach to Lagrange Multipliers
- Convergence Conditions for Ascent Methods
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimization of upper semidifferentiable functions
