Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming
Numerical Algorithms, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Idriss, Ismail I., Walter, Wolfgang V.
openaire +1 more source
New infeasible interior-point algorithm based on monomial method
Computers & Operations Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsieh, Yi-Chih, Bricker, Dennis L.
openaire +1 more source
Full Nesterov–Todd step infeasible interior-point method for symmetric optimization
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, G., Zangiabadi, M., Roos, C.
openaire +1 more source
Passivity Enforcement Using an Infeasible-Interior-Point Primal-Dual Method
IEEE Transactions on Power Systems, 2008Application of the network equivalent concept for external system representation in electromagnetic transient studies is well known. However, the challenge in application of an equivalent model, approximated by rational functions, is to guarantee passivity of the corresponding model.
B. Porkar +3 more
openaire +1 more source
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
SIAM Journal on Optimization, 2002Summary: We study an infeasible primal-dual interior-point trust-region method for constrained minimization. This method uses a log-barrier function for the slack variables and updates the slack variables using second-order correction. We show that if a certain set containing the initial iterate is bounded and the origin is not in the convex hull of ...
openaire +2 more sources
High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
Mathematics of Operations Research, 1998In this paper we develop systematically infeasible-interior-point methods of arbitrarily high order for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle, Pang and Venkateswaran (1989). The results apply to degenerate problems and problems having no strictly complementary solution.
J. Stoer, M. Wechs, S. Mizuno
openaire +2 more sources
Superlinear convergence of infeasible-interior-point methods for linear programming
Mathematical Programming, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Yin, Zhang, Detong
openaire +1 more source
A truncated primal-infeasible dual-feasible network interior point method
Networks, 2000Summary: The authors introduce the truncated primal-infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum-cost network flow problem. In each iteration, the linear system that determines the search direction is computed inexactly, and the norm of the resulting ...
Portugal, L. F. +3 more
openaire +2 more sources
An interior point method for nonlinear programming with infeasibility detection capabilities
Optimization Methods and Software, 2014This paper describes an interior point method for nonlinear programming endowed with infeasibility detection capabilities. The method is composed of two phases, a main phase whose goal is to seek optimality, and a feasibility phase that aims exclusively at improving feasibility.
Jorge Nocedal +2 more
openaire +1 more source
Applying Infeasible Interior Point Method to SQP for Constrained Nonlinear Programming
2008 International Conference on Computer Science and Software Engineering, 2008Active set (AS) method suffers deteriorating performance and premature convergence when it is faced with a nonlinear programming problem (NLP) consisting of several inequality constraints. Thus, we propose an SQP/IPM algorithm that uses infeasible interior point method (IIPM) for solving quadratic programming (QP) subproblems.
Hassan A. Bashir +2 more
openaire +1 more source