Results 81 to 90 of about 996 (126)

Implementation of Modified Effective Butterfly Optimizer in Solving Multi-Objective Pareto Optimal Power Flow Problem with Renewable Uncertainties. [PDF]

Biomimetics (Basel)
Işıker H, Akdağlı A, Yamaçlı V, Yetgin Z, Barutçu İÇ, Abacı K, Gözükara F.   +6 more
europepmc   +1 more source

Deciphering selection patterns of somatic copy-number events

Kaufmann TL, Streck A, Markowetz F, Van Loo P, Schwarz RF.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps

Optimization Methods and Software, 2002
This 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

Convergence of the homotopy path for a full-Newton step infeasible interior-point method

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C Roos
exaly   +3 more sources

Full Nesterov–Todd step infeasible interior-point method for symmetric optimization

European Journal of Operational Research, 2011
zbMATH 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, 1994
We 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

A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization

Journal of Optimization Theory and Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C Roos, Zangiabadi M, M Zangiabadi
exaly   +3 more sources

An Infeasible-Interior-Point Method for Linear Complementarity Problems

SIAM Journal on Optimization, 1997
For 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, David F. Shanno   +1 more
openaire   +1 more source

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

Superlinear convergence of infeasible-interior-point methods for linear programming

Mathematical Programming, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yin Zhang, Detong Zhang
openaire   +1 more source