Results 101 to 110 of about 17,647,919 (136)

An interior point method for nonlinear programming with infeasibility detection capabilities

Optimization Methods and Software, 2014
This 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, Figen Öztoprak, Richard A. Waltz   +2 more
openaire   +1 more source

New infeasible interior-point algorithm based on monomial method

Computers & Operations Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi-Chih Hsieh, Dennis L. Bricker
openaire   +1 more source

Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming

Numerical Algorithms, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismail I. Idriss, Wolfgang V. Walter
openaire   +2 more sources

A truncated primal-infeasible dual-feasible network interior point method

Networks, 2000
Summary: 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 ...
Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice   +3 more
openaire   +3 more sources

Applying Infeasible Interior Point Method to SQP for Constrained Nonlinear Programming

2008 International Conference on Computer Science and Software Engineering, 2008
Active 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, Ximing Liang, Shanchun Li   +2 more
openaire   +1 more source

Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization

SIAM Journal on Optimization, 2002
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 the nearly ...
openaire   +2 more sources

A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs

Optimization, 2017
In this paper, we propose an arc-search infeasible-interior-point method based on the wide neighbourhood for linear complementarity problems over symmetric cones with the Cartesian -property (-SCLC...
M. Sayadi Shahraki, H. Mansouri, M. Zangiabadi   +2 more
openaire   +2 more sources

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier

Computational Optimization and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petra Renáta Rigó, Zsolt Darvay
openaire   +2 more sources

High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems

Mathematics of Operations Research, 1998
In 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   +3 more sources

A Infeasible Interior point homotopy method for solving linear complementarity problem

2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), 2010
A global convergence Infeasible Interior point homotopy method for solving linear complementarity problem has been introduced in this paper. We give the homotopy equation and prove in details the existence of the smooth path from almost any positive orthant initial point to a solution of LCP. We give several preliminary numerical results.
null Junyan Xu, Qinghuai Liu, null Zhuang Miao   +2 more
openaire   +1 more source