A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
From MaRDI portal
Publication:4651997
DOI10.1137/S1052623403423114zbMATH Open1077.90038OpenAlexW1996119919MaRDI QIDQ4651997FDOQ4651997
Authors: M. El Ghami, C. Roos, Yanqin Bai 
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623403423114
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
Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05) Interior-point methods (90C51)
Cited In (only showing first 100 items - show all)
- Kernel function based interior-point methods for horizontal linear complementarity problems
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- Interior-point methods based on kernel functions for symmetric optimization
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- A full-Newton step interior-point algorithm based on modified Newton direction
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- An adaptive-step primal-dual interior point algorithm for linear optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- Title not available (Why is that?)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- 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
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
- Derivatives of eigenvalues and Jordan frames
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- An interior-point algorithm for linear optimization based on a new barrier function
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- Kernel-function Based Algorithms for Semidefinite Optimization
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
- An efficient logarithmic barrier method without line search for convex quadratic programming
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- 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
- Interior-point algorithm for linear programming based on a new descent direction
- A new class of infeasible interior-point algorithm for linear complementarity problem
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- New parameterized kernel functions for linear optimization
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- A generic kernel function for interior point methods
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- A corrector-predictor path-following algorithm for semidefinite optimization
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
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)
