A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
From MaRDI portal
Publication:627154
DOI10.1016/J.AMC.2010.11.049zbMATH Open1210.65111OpenAlexW2072933255MaRDI QIDQ627154FDOQ627154
Authors: Zhongyi Liu, Wenyu Sun 
Publication date: 21 February 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.049
Recommendations
- A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
- A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
semidefinite programmingpolynomial complexityinfeasible interior-point methodskernel functionsfull Nesterov-Todd steps
Cites Work
- Self-regular functions and new search directions for linear and semidefinite optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
Cited In (11)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- A full-Newton step infeasible interior point algorithm and its parameters analysis
- A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
This page was built for publication: A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627154)
