Results 211 to 220 of about 27,291 (261)

Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization

, 2003
Michael J. Todd
openalex   +1 more source

Maximising the wrench capability of mobile manipulators with experiments on a UVMS. [PDF]

Front Robot AI
Marais WJ, Pizarro O, Williams SB.
europepmc   +1 more source

Admission NIHSS score and diabetes as independent predictors of in-hospital early neurological improvement following mechanical thrombectomy: a retrospective cohort study. [PDF]

Front Neurol
Zhao C, Li X, Han Y, Ren X, Sun Y.
europepmc   +1 more source

Toward Rational Design of Ion-Exchange Nanofiber Membranes: Meso-Scale Computational Approaches. [PDF]

Membranes (Basel)
Boztepe I, Zhao S, Yang X, Kong L.
europepmc   +1 more source

AoI-Aware Data Collection in Heterogeneous UAV-Assisted WSNs: Strong-Agent Coordinated Coverage and Vicsek-Driven Weak-Swarm Control. [PDF]

Sensors (Basel)
Huang L, Li L, Zhao S, Qu D, Xu J.
europepmc   +1 more source

Herbal decoctions for dysmenorrhea under universal health coverage pilot project: Evidence from a nationwide claims database in the Republic of Korea. [PDF]

Integr Med Res
Bae K, Park M, Yi J.
europepmc   +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
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

SIAM Journal on Optimization, 1994
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

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.
Shinji Mizuno
exaly   +3 more sources