AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

DOI10.1142/S0217595909002250zbMATH Open1176.90453OpenAlexW2118696995MaRDI QIDQ3392293FDOQ3392293

Authors: 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

Recommendations

• Kernel function based interior-point algorithms for semidefinite optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• Interior-point algorithm for SDO based on new classes of kernel functions
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions

zbMATH Keywords

polynomial complexitysemidefinite optimizationlarge-update methodprimal-dual interior-point method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Semidefinite Programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• 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
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• An interior point method for linear programming based on a class of Kernel functions

Cited In (17)

• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• Interior-point algorithms for LO and SDO based on a new class of kernel functions
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• Interior-point algorithm for SDO based on new classes of kernel functions
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• Title not available (Why is that?)
• The accuracy of interior-point methods based on kernel functions
• Kernel-function Based Algorithms for Semidefinite Optimization
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Self-regular interior-point methods for semidefinite optimization
• Kernel function based interior-point algorithms for semidefinite optimization
• A full-Newton step feasible IPM for semidefinite optimization based on a kernel function with linear growth term
• Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392293)