A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
From MaRDI portal
Publication:4639122
DOI10.1080/02331934.2017.1387258zbMath1398.90119OpenAlexW2760879088MaRDI QIDQ4639122
No author found.
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1387258
semidefinite optimizationprimal-dual interior-point methodslarge-update methodstrigonometric kernel function
Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)
Related Items (7)
An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ 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 ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- A feasible primal-dual interior point method for linear semidefinite programming
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- An interior-point algorithm for linear optimization based on a new kernel function
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- Path-Following Methods for Linear Programming
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- SDPLIB 1.2, a library of semidefinite programming test problems
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- 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 unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
