Sufficient Fritz John optimality conditions for nondifferentiable convex programming
From MaRDI portal
Publication:4127652
Cited in
(14)- Constrained minimax for a vector-valued function
- Optimality conditions for a class of nondifferentiable minmax programming problems
- A modified wolfe dual for weak vector minimization
- Mixed symmetric duality for nondifferentiable programming problems
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- A NOTE ON MOND-WEIR TYPE SECOND-ORDER SYMMETRIC DUALITY
- Complete characterization of optimality for convex programming in banach spaces†
- A class of nondifferentiable continuous programming problems
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- On a finite element method for a certain class of time-dependent problems
- Invex functions and constrained local minima
- Geometric branch-and-bound methods for constrained global optimization problems
- Symmetric dual nondifferentiable programs
- NONDIFFERENTIABLE SECOND-ORDER SYMMETRIC DUALITY
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)