802 results on '"Polynomial complexity"'
Search Results
202. A new class of infeasible interior-point algorithm for linear complementarity problem.
203. A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems.
204. Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
205. Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term.
206. Mehrotra-type predictor–corrector algorithms for sufficient linear complementarity problem
207. A weighted target- following algorithm for linearly constrained convex optimization.
208. A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization.
209. Polynomial Convergence of Second-Order Mehrotra-Type Predictor-Corrector Algorithms over Symmetric Cones.
210. IMPROVED INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR COMPLEMENTARITY PROBLEMS.
211. Interior-point methods for Cartesian P * (κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions.
212. A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY.
213. A Predictor-corrector algorithm with multiple corrections for convex quadratic programming.
214. Constructing partial words with subword complexities not achievable by full words
215. Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step.
216. A new second-order corrector interior-point algorithm for semidefinite programming.
217. Interior-point algorithm for linear optimization based on a new kernel function.
218. On Extending Some Wide-neighborhood Interior Point Algorithms From Linear Programming To Linear Complementarity Problems.
219. On an equivalence checking technique for algebraic models of programs.
220. An $${O(\sqrt{n}L)}$$ iteration primal-dual second-order corrector algorithm for linear programming.
221. A class of new large-update primal-dual interior-point algorithms for P( κ) nonlinear complementarity problems.
222. Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones.
223. A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY.
224. NEW COMPLEXITY ANALYSIS OF A FULL NESTEROV-TODD STEPS IIPM FOR SEMIDEFINITE OPTIMIZATION.
225. A full-Newton step infeasible-interior-point algorithm for linear complementarity problems
226. Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming.
227. A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
228. A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming.
229. A kernel function based Interior-Point Methods for solving P*( κ)-linear complementarity problem.
230. Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
231. On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization.
232. Using solvable classes of systems for scheduling of real-time computations with minimized jitter
233. Initial-state detectability and initial-state opacity of unambiguous weighted automata
234. A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms.
235. A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function.
236. A SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION.
237. A primal-infeasible interior point algorithm for linearly constrained convex programming.
238. A polynomial algorithm for recognizing the -order class
239. AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS.
240. Primal–dual interior-point algorithms for second-order cone optimization based on kernel functions
241. Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
242. A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION.
243. Interior-point algorithm based on general kernel function for monotone linear complementarity problem.
244. Exploring complexity of large update interior-point methods for linear complementarity problem based on Kernel function
245. A POLYNOMIAL-TIME INTERIOR-POINT METHOD FOR CONIC OPTIMIZATION, WITH INEXACT BARRIER EVALUATIONS.
246. Optimal Petri-Net-B ased Polynomial-Complexity Deadlock-Avoidance Policies for Automated Manufacturing Systems.
247. Polynomial Convergence of Primal-Dual Path-Following Algorithms for Symmetric Cone Programming Based on Wide Neighborhoods and a New Class of Directions
248. A new infeasible-interior-point algorithm for linear programming over symmetric cones
249. An ℓ 2 -neighborhood infeasible interior-point algorithm for linear complementarity problems
250. A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.