The following pages link to (Q4339096):
Displaying 50 items.
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- An efficient fifth-order method for linear optimization (Q306315) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
- A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem (Q857834) (← links)
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines (Q869526) (← links)
- Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
