A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
From MaRDI portal
(Redirected from Publication:4651997)
Recommendations
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- An efficient parameterized logarithmic kernel function for linear optimization
Cited in
(only showing first 100 items - show all)- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
- On self-regular IPMs (with comments and rejoinder)
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- The accuracy of interior-point methods based on kernel functions
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- An efficient parameterized logarithmic kernel function for semidefinite optimization
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- A generic kernel function for interior point methods
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
- An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- 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
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Large-update interior point algorithm for P_*-linear complementarity problem
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- Interior-point methods based on kernel functions for symmetric optimization
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A corrector-predictor path-following algorithm for semidefinite optimization
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- Kernel-function based primal-dual algorithms for P_* ( ) linear complementarity problems
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- An efficient fifth-order method for linear optimization
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Infeasible interior-point methods for linear optimization based on large neighborhood
- Derivatives of eigenvalues and Jordan frames
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- Interior point methods for self-dual linear optimization problems based on kernel functions
- An interior-point algorithm based on general kernel function for monotone linear complementarity problem
- A penalized interior point approach for constrained nonlinear programming
- Kernel-function Based Algorithms for Semidefinite Optimization
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Kernel function based interior-point methods for horizontal linear complementarity problems
- A full-Newton step interior-point algorithm based on modified Newton direction
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- An adaptive-step primal-dual interior point algorithm for linear optimization
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- Primal-dual algorithms for P_() linear complementarity problems based on kernel-function with trigonometric barrier term
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
This page was built for publication: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651997)
