A globally convergent primal-dual interior point method for constrained optimization
From MaRDI portal
Publication:4946718
DOI10.1080/10556789808805723zbMath0946.90110OpenAlexW2010511518MaRDI QIDQ4946718
Publication date: 4 June 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805723
Related Items (26)
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ An interior-point algorithm for computing equilibria in economies with incomplete asset markets ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ A note on the use of vector barrier parameters for interior-point methods ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity ⋮ A hybrid strategy blending primal‐dual interior point and return mapping methods for a class of hypoelastic‐plastic models with memory surface ⋮ A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties ⋮ An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming ⋮ Fast quadratic programming for mean-variance portfolio optimisation ⋮ Portfolio optimization with entropic value-at-risk ⋮ An interior-point algorithm for nonlinear minimax problems ⋮ On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming ⋮ A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ A primal-dual interior point method for nonlinear semidefinite programming ⋮ Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints ⋮ A primal-dual interior point method to implicitly update Gurson-Tvergaard-Needleman model ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ Unnamed Item ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ A filter interior-point algorithm with projected Hessian updating for nonlinear optimization ⋮ Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions ⋮ Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems ⋮ ParNMPC – a parallel optimisation toolkit for real-time nonlinear model predictive control
This page was built for publication: A globally convergent primal-dual interior point method for constrained optimization
