Cargando…
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and contro...
Autores principales: | Pearson, John W., Gondzio, Jacek |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5666087/ https://www.ncbi.nlm.nih.gov/pubmed/29151623 http://dx.doi.org/10.1007/s00211-017-0892-8 |
Ejemplares similares
-
On the solution of equality constrained quadratic programming problems arising in optimization
por: Gould, N I M, et al.
Publicado: (1998) -
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization
por: Wu, Zeguan, et al.
Publicado: (2023) -
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion
por: Bellavia, Stefania, et al.
Publicado: (2021) -
A specialized primal-dual interior point method for the plastic truss layout optimization
por: Weldeyesus, Alemseged Gebrehiwot, et al.
Publicado: (2018) -
Interior point approach to linear, quadratic and convex programming: algorithms and complexity
por: Hertog, D
Publicado: (1994)