Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
From MaRDI portal
Publication:5745159
DOI10.1080/02331934.2018.1426579zbMath1406.90116OpenAlexW2793597930MaRDI QIDQ5745159
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
parametric optimizationnonsmooth optimizationmathematical programmingvariational analysis and optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diagonal bundle method for nonsmooth sparse optimization
- 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
- Continuous subdifferential approximations and their applications
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Introduction to Nonsmooth Optimization
- Functional Analysis, Calculus of Variations and Optimal Control
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Some examples and counterexamples for the stability analysis of nonlinear programming problems
- On Subdifferentials of Optimal Value Functions
- Optimization and nonsmooth analysis
- Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
- Differential properties of the marginal function in mathematical programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Convex Analysis
- Set-valued analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization