Saddlepoint Problems in Nondifferentiable Programming

DOI10.1080/02522667.1990.10699019zbMath0719.90074OpenAlexW2042937263MaRDI QIDQ5752299

Thomas W. Reiland

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699019

zbMATH Keywords

Banach spacenondifferentiable programmingSaddlepoint optimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• Subdifferentials of compactly Lipschitzian vector-valued functions
• A duality theorem for a convex programming problem in order complete vector lattices
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Necessary Conditions in Nonsmooth Optimization
• Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
• Optimization and nonsmooth analysis
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• On optimality conditions in nondifferentiable programming
• A New Approach to Lagrange Multipliers
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Directionally Lipschitzian Functions and Subdifferential Calculus
• Approximating a Second-Order Directional Derivative for Nonsmooth Convex Functions
• Nonlinear Programming in Banach Space
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space

This page was built for publication: Saddlepoint Problems in Nondifferentiable Programming