Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
From MaRDI portal
(Redirected from Publication:471570)
Recommendations
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- An infeasible full-NT step interior point algorithm for CQSCO
- A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function
Cites work
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A full-Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
Cited in
(5)- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
This page was built for publication: Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471570)