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 new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions (Q2062428) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
- 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 (Q2361520) (← links)
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP (Q2436131) (← links)
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions (Q2442632) (← links)
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems (Q2458697) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems (Q2483352) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function (Q2583508) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- Self-Regular Interior-Point Methods for Semidefinite Optimization (Q2802533) (← links)
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
- A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY (Q2895762) (← links)
- A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
- A corrector–predictor path-following algorithm for semidefinite optimization (Q2920903) (← links)
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
- Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677) (← links)
- Kernel-function Based Primal-Dual Algorithms for<i>P</i><sub><sub>*</sub></sub>(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← 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 method for weighted projections to the positive definite cone (Q3453401) (← links)
- A full NT-step infeasible interior-point algorithm for semidefinite optimization (Q4603922) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)
