Optimal solution approximation for infinite positive-definite quadratic programming
From MaRDI portal
Publication:1897449
DOI10.1007/BF02192225zbMATH Open0826.49024OpenAlexW2035084957MaRDI QIDQ1897449FDOQ1897449
Authors: Yanyan Li 
Publication date: 27 August 1995
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192225
Recommendations
- Infinite positive-definite quadratic programming in a Hilbert space
- Optimal solution characterization for infinite positive semi-definite programming
- scientific article; zbMATH DE number 1099087
- Approximation algorithms for indefinite quadratic programming
- On solving convex quadratic semi-infinite programming probelms
- Algorithms for infinite quadratic programming in \(L_p\) spaces
- scientific article; zbMATH DE number 4031413
- scientific article; zbMATH DE number 7647868
- An approximation approach to non-strictly convex quadratic semi-infinite programming
- scientific article; zbMATH DE number 4095211
time-varying systemsoptimal solutioninfinite-horizon optimizationLQ control problempositive-definite costspositive-definite quadratic programmingsolution approximations
Cites Work
Cited In (7)
- A cutting plane approach to solving quadratic infinite programs on measure spaces.
- Algorithms for infinite quadratic programming in \(L_p\) spaces
- Optimal solution characterization for infinite positive semi-definite programming
- Title not available (Why is that?)
- Infinite positive-definite quadratic programming in a Hilbert space
- Infinite networks and quadratic optimal control
- Solution approximation in infinite horizon linear quadratic control
This page was built for publication: Optimal solution approximation for infinite positive-definite quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897449)
