Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing

From MaRDI portal
Publication:1424286

DOI10.1007/s10107-003-0418-2zbMath1055.90068OpenAlexW2125546466MaRDI QIDQ1424286

Robert J. Vanderbei, Hande Y. Benson, David F. Shanno

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0418-2



Related Items

Interior-point solver for large-scale quadratic programming problems with bound constraints, Interior point method for long-term generation scheduling of large-scale hydrothermal systems, Best practices for comparing optimization algorithms, Interior-point algorithms, penalty methods and equilibrium problems, Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, An interior-point algorithm for nonlinear minimax problems, A modified SQP-filter method for nonlinear complementarity problem, Primal-dual interior-point method for thermodynamic gas-particle partitioning, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Nonlinear least square based on control direction by dual method and its application, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set, Practical implementation of an interior point nonmonotone line search filter method, A penalty-function-free line search SQP method for nonlinear programming, A primal-dual interior-point algorithm for nonlinear least squares constrained problems, Numerical solution of optimal control of atherosclerosis using direct and indirect methods with shooting/collocation approach, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, Global convergence enhancement of classical linesearch interior point methods for MCPs


Uses Software