Convex programming and systems of elementary monotonic relations
From MaRDI portal
Publication:2525908
DOI10.1016/0022-247X(67)90011-XzbMath0152.38006MaRDI QIDQ2525908
Publication date: 1967
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Duale Optimierungsaufgaben und Sattelpunktsätze, Inversion of real-valued functions and applications, Proof of global convergence of an efficient algorithm for predicting trip generation, trip distribution, modal split and traffic assignment simultaneously on large-scale networks, Infinite nonlinear resistive networks, after Minty, An improved origin-based algorithm for solving the combined distribution and assignment problem, Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models, A simplex algorithm for piecewise-linear programming I: Derivation and proof
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theorem on maximal monotonic sets in Hilbert space
- Characterization of the subdifferentials of convex functions
- Duality and stability in extremum problems involving convex functions
- Monotone networks
- Duality theorems for convex functions
- On Conjugate Convex Functions