A variant of nonstandard convex programming

DOI10.1007/BF00969166MaRDI QIDQ1101012zbMATH OpenOpenAlexFDO

Authors S. S. Kutateladze

Publication date 1986

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00969166

zbMATH Keywords

infinitesimal subdifferentialsinfinitesimally optimal solutionnonstandard analysisnonstandard convex programming

Mathematics Subject Classification ID

Other applications of nonstandard models (economics, physics, etc.) (03H10) Convex programming (90C25)

Review text

Translation from Sib. Mat. Zh. 27, No.4(158), 84-92 (Russian) (1986; Zbl 0618.90074).

Cites work

• Abstract disintegration in Kantorovich spaces
• scientific article; zbMATH DE number 3694956 (Why is no real title available?)
• scientific article; zbMATH DE number 51069 (Why is no real title available?)
• scientific article; zbMATH DE number 3559571 (Why is no real title available?)
• scientific article; zbMATH DE number 4000741 (Why is no real title available?)
• Internal set theory: A new approach to nonstandard analysis

Cited in

(3)

• A concave-convex problem with a variable operator
• Variants to the cutting plane approach for convex nondifferentiable optimization
• Math-Selfie

This page was built for publication: A variant of nonstandard convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101012)