On infinite-dimensional convex programs

DOI10.1016/S0022-0000(67)80023-0MaRDI QIDQ2553312zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• A Class of Variational Problems in Search Theory and the Maximum Principle
• A Rapidly Convergent Descent Method for Minimization
• GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 3244852 (Why is no real title available?)
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• On a Method of Courant for Minimizing Functionals
• Optimum Control, Inequality State Constraints, and the Generalized Newton-Raphson Algorithm
• The Slacked Unconstrained Minimization Technique for Convex Programming
• Variational methods for the solution of problems of equilibrium and vibrations

Cited in

(4)

• Additive regression for predictors of various natures and possibly incomplete Hilbertian responses
• New necessary conditions of optimality for control problems with state- variable inequality constraints
• A constructive proof of the Kuhn-Tucker multiplier rule
• Multisymplectic variational integrators for nonsmooth Lagrangian continuum mechanics

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)