Cargando…
Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
In this paper, a class of nonlinear constrained optimization problems with both inequality and equality constraints is discussed. Based on a simple and effective penalty parameter and the idea of primal-dual interior point methods, a QP-free algorithm for solving the discussed problems is presented....
Autores principales: | Jian, Jinbao, Zeng, Hanjun, Ma, Guodong, Zhu, Zhibin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5622232/ https://www.ncbi.nlm.nih.gov/pubmed/29033531 http://dx.doi.org/10.1186/s13660-017-1500-2 |
Ejemplares similares
-
Self-regularity: a new paradigm for primal-dual interior-point algorithms
por: Peng, Jimine, et al.
Publicado: (2002) -
A primal-dual algorithm framework for convex saddle-point optimization
por: Zhang, Benxin, et al.
Publicado: (2017) -
A new filter QP-free method for the nonlinear inequality constrained optimization problem
por: Shang, Youlin, et al.
Publicado: (2018) -
A specialized primal-dual interior point method for the plastic truss layout optimization
por: Weldeyesus, Alemseged Gebrehiwot, et al.
Publicado: (2018) -
A globally convergent QP-free algorithm for nonlinear semidefinite programming
por: Li, Jian-Ling, et al.
Publicado: (2017)