Pages that link to "Item:Q1849264"
From MaRDI portal
The following pages link to Self-regular functions and new search directions for linear and semidefinite optimization (Q1849264):
Displaying 50 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- Several matrix trace inequalities on Hermitian and skew-Hermitian matrices (Q257748) (← links)
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
- A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← 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 full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← 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)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← links)
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions (Q1694775) (← links)
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term (Q1724788) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397) (← links)
