Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

DOI10.1007/S11075-012-9557-YzbMATH Open1259.65091OpenAlexW2046182672MaRDI QIDQ695048FDOQ695048

Authors: Behrouz Kheirfam 

Publication date: 20 December 2012

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-012-9557-y

Recommendations

• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• A new primal-dual interior-point algorithm for semidefinite optimization
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

zbMATH Keywords

polynomial complexitysemidefinite optimizationkernel functionprimal-dual methodinterior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semidefinite programming (90C22)

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Analytic Inequalities
• Self-regular functions and new search directions for linear and semidefinite optimization
• A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Title not available (Why is that?)
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Kernel-function Based Algorithms for Semidefinite Optimization
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• A new class of polynomial primal-dual methods for linear and semidefinite optimization

Cited In (30)

• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• A generic kernel function for interior point methods
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
• Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
• A new primal-dual interior-point algorithm for semidefinite optimization
• A wide neighborhood interior-point algorithm based on the trigonometric kernel function
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
• An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
• A novel neural network for solving semidefinite programming problems with some applications
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function

This page was built for publication: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

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