An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:2066199
DOI10.1007/s11075-021-01113-wzbMath1483.90180arXiv1909.10706OpenAlexW3161585374MaRDI QIDQ2066199
Makoto Yamashita, Einosuke Iida, Ya-Guang Yang
Publication date: 13 January 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.10706
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial arc-search interior-point algorithm for linear programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Computational experience with a primal-dual interior point method for linear programming
- An interior-point algorithm for nonconvex nonlinear programming
- Inverses of \(2\times 2\) block matrices
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- A Note on Performance Profiles for Benchmarking Software
- A trust region method based on interior point techniques for nonlinear programming.
This page was built for publication: An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
