Convex Parametric Programming in Abstract Spaces
From MaRDI portal
Recommendations
- A survey of methods of abstract convex programming
- Abstract convexity and global optimization
- Generalized convexity and vector optimization.
- scientific article; zbMATH DE number 1859290
- scientific article; zbMATH DE number 3898632
- scientific article; zbMATH DE number 2121575
- scientific article; zbMATH DE number 2107836
- Generalized convexity and mathematical programs
- Approximating parameterized convex optimization problems
- Approximating parameterized convex optimization problems
Cites work
- scientific article; zbMATH DE number 3791103 (Why is no real title available?)
- scientific article; zbMATH DE number 3596767 (Why is no real title available?)
- scientific article; zbMATH DE number 3604647 (Why is no real title available?)
- scientific article; zbMATH DE number 1471810 (Why is no real title available?)
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Characterizing an optimal input in perturbed convex programming
- Characterizing optimality in mathematical programming models
- Constraint qualifications in input optimisation
- Note on a Fundamental Relationship Between Admissible and Bayesian Decision Rules
- One-sided derivatives for the value function in convex parametric programming
- Partly convex programming and Zermelo's navigation problems
- Point-to-Set Maps in Mathematical Programming
- Regularity and stability for the mathematical programming problem in Banach spaces
- Semi-Infinite Programming: Theory, Methods, and Applications
- Some recent results in parametric semi-infinite programming
- Stable parametric programming*
- Statistical decision theory and Bayesian analysis. 2nd ed
Cited in
(4)
This page was built for publication: Convex Parametric Programming in Abstract Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805779)
