A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
From MaRDI portal
Publication:1790186
DOI10.1016/j.orl.2016.02.013zbMath1408.90319OpenAlexW2291535362MaRDI QIDQ1790186
Publication date: 2 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.02.013
Related Items (12)
A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control ⋮ Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions ⋮ An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ 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 ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term ⋮ 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 interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
