An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
type: Item
instance of: scholarly article
title: An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
zbMATH Open document ID: 1327.90390
author: Behrouz Kheirfam
published in: Journal of Mathematical Modelling and Algorithms in Operations Research
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6514995
zbMATH Keywords: infeasible interior-point algorithm
zbMATH Keywords: semidefinite optimization
zbMATH Keywords: full Nesterov-Todd step
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s10852-014-9257-9
OpenAlex ID: W2127196349
cites work: Finding a strict feasible solution of a linear semidefinite program
cites work: Q3415802
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: A new polynomial-time algorithm for linear programming
cites work: Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
cites work: A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
cites work: A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
cites work: Q5409921
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
cites work: An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
cites work: Polynomiality of infeasible-interior-point algorithms for linear programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: Q4339096
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
cites work: A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
cites work: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
DOI: 10.1007/S10852-014-9257-9
description: scientific article; zbMATH DE number 6514995