Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
From MaRDI portal
Publication:5745159
DOI10.1080/02331934.2018.1426579zbMATH Open1406.90116OpenAlexW2793597930MaRDI QIDQ5745159FDOQ5745159
Authors: Martin Knossalla 
Publication date: 5 June 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1426579
Recommendations
- Continuous exterior subdifferentials and their application to optimizing local Lipschitz-continuous functions
- Continuous outer subdifferentials in nonsmooth optimization
- Computing subdifferentials of marginal functions
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- Continuous methods of unconstrained minimization of hypodifferentiable functions
mathematical programmingnonsmooth optimizationparametric optimizationvariational analysis and optimization
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Convex Analysis
- Methods of descent for nondifferentiable optimization
- Functional analysis, calculus of variations and optimal control
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Set-valued analysis
- Stability and regular points of inequality systems
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Subgradients of marginal functions in parametric mathematical programming
- New variants of bundle methods
- Title not available (Why is that?)
- Continuous subdifferential approximations and their applications
- Title not available (Why is that?)
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Some examples and counterexamples for the stability analysis of nonlinear programming problems
- On Subdifferentials of Optimal Value Functions
- Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
- Differential properties of the marginal function in mathematical programming
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Diagonal bundle method for nonsmooth sparse optimization
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
Cited In (2)
Uses Software
This page was built for publication: Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745159)
