Results 221 to 230 of about 44,584 (264)

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

SIAM Journal on Optimization, 2002
Summary: 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

An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

Numerical Algorithms, 2019
In this paper, we propose an infeasible arc-search interior-point algorithm for solving nonlinear programming problems. Most algorithms based on interior-point methods are categorized as line search since they compute a next iterate on a straight line ...
M. Yamashita, E. Iida, Yaguang Yang
semanticscholar   +1 more source

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 ...
Portugal, L. F., Resende, M. G. C., Veiga, G., Júdice, J. J.   +3 more
openaire   +2 more sources

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

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

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

Status determination by interior-point methods for convex optimization problems in domain-driven form

Mathematical programming, 2019
We study the geometry of convex optimization problems given in a Domain-Driven form and categorize possible statuses of these problems using duality theory. Our duality theory for the Domain-Driven form, which accepts both conic and non-conic constraints,
M. Karimi, L. Tunçel
semanticscholar   +1 more source

Infeasible interior point methods for sufficient linear complementarity problems

2009
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the central path. We present a new first order corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available.
openaire   +1 more source

A Infeasible Interior point homotopy method for solving horizontal linear complementarity problem

2011 International Conference on Computer Science and Service System (CSSS), 2011
A global convergence Infeasible Interior point homotopy method for solving horizontal 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 HLCP.
null Junyan Xu, null Zhuang Miao, Qinghuai Liu   +2 more
openaire   +1 more source

An improved and modified infeasible interior-point method for symmetric optimization

Asian-European Journal of Mathematics, 2016
In this paper an improved and modified version of full Nesterov–Todd step infeasible interior-point methods for symmetric optimization published in [A new infeasible interior-point method based on Darvay’s technique for symmetric optimization, Ann. Oper. Res. 211(1) (2013) 209–224; G. Gu, M. Zangiabadi and C.
openaire   +1 more source