Data-driven acceleration of mixed-integer bilinear programs: a comparative study for robot motion planning. [PDF]
Front Robot AILin X.
europepmc +1 more source
Deciphering selection patterns of somatic copy-number events
Kaufmann TL +4 more
europepmc +1 more source
Related searches:
Superlinear convergence of infeasible-interior-point methods for linear programming
Mathematical Programming, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yin Zhang, Detong Zhang
exaly +2 more sources
An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
Optimization Methods and Software, 2002This article describes an infeasible interior-point (IP) method for solving monotone variational inequality problems with polyhedral constraints and, as a particular case, monotone nonlinear complementarity problems. The method determines a search direction by solving, possibly in an inexact way, the Newton equation for the central path.
Sandra Pieraccini
exaly +4 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.
Shinji Mizuno
exaly +3 more sources
Summary: Interior-point methods require strictly feasible points as starting points. In theory, this requirement does not seem to be particularly restrictive, but it can be costly in computation. To overcome this deficiency, most existing practical algorithms allow positive but infeasible starting points and seek feasibility and optimality ...
exaly +3 more sources
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.
C Roos, M Zangiabadi
exaly +2 more sources
On the convergence of an infeasible primal-dual interior-point method for convex programming
Optimization Methods and Software, 1994We consider the infeasible primal-dual algorithm for smooth convex programming recently introduced by Vial [15]. We show, under mild assumptions, that a “SUMT” or “long-step path following” version of the algorithm is globally convergent. The stepiength on each iteration is based on a merit function which is a modification of the potential function ...
Kurt Anstreicher, Jean-Philippe Vial
exaly +2 more sources
An Infeasible-Interior-Point Method for Linear Complementarity Problems
SIAM Journal on Optimization, 1997For the linear complementarity problem (LCP) of the form: determine a vector pair \((x,z)\) satisfying \(Mx-c=z\), \(x^{T}z= 0\), \((x,z) \leq {\mathbf 0}\), where \(x,z,c \in {\mathbb{R}}^{n}\) and \(M \in {\mathbb{R}}^{n}\times {\mathbb{R}}^{n}\), the authors propose an infeasible-interior-point algorithm based on a method being a modification of a ...
Evangelia M. Simantiraki +1 more
openaire +1 more source
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