AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

DOI10.1142/S0217595909002250zbMath1176.90453OpenAlexW2118696995MaRDI QIDQ3392293

M. Reza Peyghami

Publication date: 14 August 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002250

zbMATH Keywords

semidefinite optimizationpolynomial complexitylarge-update methodprimal-dual interior-point method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Related Items (8)

A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ The accuracy of interior-point methods based on kernel functions ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• An interior point method for linear programming based on a class of Kernel functions
• Semidefinite Programming

This page was built for publication: AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS