Optimization of upper semidifferentiable functions

DOI10.1007/BF00938396zbMATH Open0534.90069OpenAlexW1980252045MaRDI QIDQ790713FDOQ790713

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 analysis generalized gradient generalized Wolfe's algorithm Mifflin's algorithm nonconvex, nondifferentiable function upper semidifferentiable functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Continuity and differentiation questions (26B05)

Recommendations

An algorithm to minimize the sum of a semi-smooth function and a \(C^ 1\) function
scientific article; zbMATH DE number 151654
A minimizing algorithm for complex nonconvex nondifferentiable functions
On an algorithm in nondifferential convex optimization
scientific article; zbMATH DE number 4066649

Cites Work

scientific article; zbMATH DE number 3559294 (Why is no real title available?)
scientific article; zbMATH DE number 3577030 (Why is no real title available?)
scientific article; zbMATH DE number 3282977 (Why is no real title available?)
A New Approach to Lagrange Multipliers
Algorithms for some minimax problems
An Algorithm for Constrained Optimization with Semismooth Functions
Convergence Conditions for Ascent Methods
Convex Analysis
Generalized Gradients and Applications
On the variational principle
Optimization of lipschitz continuous functions

Cited In (26)

\(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
Survey of Bundle Methods for Nonsmooth Optimization
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
Descent methods for quasidifferentiable minimization
Upper semismooth functions and the subdifferential determination property
A gradient sampling algorithm for stratified maps with applications to topological data analysis
Subgradient and bundle methods for nonsmooth optimization
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
Globally convergent variable metric method for convex nonsmooth unconstrained minimization
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
A hierarchy of spectral relaxations for polynomial optimization
Comparing different nonsmooth minimization methods and software
An algorithm for minimizing a class of locally Lipschitz functions
Weak convexity and approximate subdifferentials
Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control
Diagonal bundle method for nonsmooth sparse optimization
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
_∊-gradients pour les ponctions localements lipschitziennes et applications
Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
ε-Subdifferential and ε-monotonicity

This page was built for publication: Optimization of upper semidifferentiable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790713)