Pages that link to "Item:Q4441922"
From MaRDI portal
The following pages link to A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier (Q4441922):
Displaying 23 items.
- Kernel-function Based Primal-Dual Algorithms for<i>P</i><sub><sub>*</sub></sub>(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming (Q3368128) (← links)
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS (Q3392293) (← links)
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods (Q3505061) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642) (← links)
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
- An interior point method for linear programming based on a class of Kernel functions (Q4654260) (← links)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) (← links)
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions (Q5299914) (← links)
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)
- A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
- A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)
- A full-Newton step infeasible interior point algorithm and its parameters analysis (Q6536945) (← links)
- Dislocation hyperbolic kernel function (Q6620698) (← links)
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)