On infinite-dimensional convex programs
From MaRDI portal
Publication:2553312
DOI10.1016/S0022-0000(67)80023-0zbMATH Open0239.90040OpenAlexW1985169665MaRDI QIDQ2553312FDOQ2553312
Authors: Edward Beltrami 
Publication date: 1967
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(67)80023-0
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
- Variational methods for the solution of problems of equilibrium and vibrations
- Title not available (Why is that?)
- The Slacked Unconstrained Minimization Technique for Convex Programming
- Optimum Control, Inequality State Constraints, and the Generalized Newton-Raphson Algorithm
- On a Method of Courant for Minimizing Functionals
- A Class of Variational Problems in Search Theory and the Maximum Principle
Cited In (4)
- New necessary conditions of optimality for control problems with state- variable inequality constraints
- Additive regression for predictors of various natures and possibly incomplete Hilbertian responses
- Multisymplectic variational integrators for nonsmooth Lagrangian continuum mechanics
- A constructive proof of the Kuhn-Tucker multiplier rule
This page was built for publication: On infinite-dimensional convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553312)
