Saddlepoint Problems in Nondifferentiable Programming
From MaRDI portal
DOI10.1080/02522667.1990.10699019zbMATH Open0719.90074OpenAlexW2042937263MaRDI QIDQ5752299FDOQ5752299
Authors: 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
Recommendations
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- Saddlepoints for convex programming in order vector spaces
- FIRST-ORDER OPTIMALITY CONDITIONS IN NONDIFFERENTIABLE PROGRAMMING PROBLEMS
- scientific article; zbMATH DE number 205728
- scientific article; zbMATH DE number 416855
Cites Work
- Optimization and nonsmooth analysis
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Title not available (Why is that?)
- Subdifferentials of compactly Lipschitzian vector-valued functions
- A New Approach to Lagrange Multipliers
- Title not available (Why is that?)
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Title not available (Why is that?)
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- On optimality conditions in nondifferentiable programming
- Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Nonlinear Programming in Banach Space
- Necessary Conditions in Nonsmooth Optimization
- A duality theorem for a convex programming problem in order complete vector lattices
- Title not available (Why is that?)
- Approximating a Second-Order Directional Derivative for Nonsmooth Convex Functions
Cited In (11)
- G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- Saddle problem and optimization problem as an integrated system
- Saddle point criteria and the exact minimax penalty function method in nonconvex programming
- Saddlepoints for convex programming in order vector spaces
- Title not available (Why is that?)
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Nonsmooth interval-valued optimization and saddle-point optimality criteria
- On saddle points and optima for non-smooth and non-convex programs
- Solution point differentiability without strict complementarity in nonlinear programming
- Equivalence of saddle-points and optima for non-concave programmes
This page was built for publication: Saddlepoint Problems in Nondifferentiable Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752299)
