Sufficient Fritz John optimality conditions for nondifferentiable convex programming
From MaRDI portal
Publication:4127652
DOI10.1017/S0334270000001326zbMATH Open0355.90058OpenAlexW2313401481MaRDI QIDQ4127652FDOQ4127652
Authors: B. D. Craven, Bertram Mond 
Publication date: 1976
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0334270000001326
Cited In (14)
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- Symmetric dual nondifferentiable programs
- Geometric branch-and-bound methods for constrained global optimization problems
- NONDIFFERENTIABLE SECOND-ORDER SYMMETRIC DUALITY
- A class of nondifferentiable continuous programming problems
- Complete characterization of optimality for convex programming in banach spaces†
- Optimality conditions for a class of nondifferentiable minmax programming problems
- A NOTE ON MOND-WEIR TYPE SECOND-ORDER SYMMETRIC DUALITY
- Mixed symmetric duality for nondifferentiable programming problems
- On a finite element method for a certain class of time-dependent problems
- A modified wolfe dual for weak vector minimization
- Title not available (Why is that?)
- Invex functions and constrained local minima
- Constrained minimax for a vector-valued function
This page was built for publication: Sufficient Fritz John optimality conditions for nondifferentiable convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127652)
