Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
From MaRDI portal
(Redirected from Publication:695048)
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
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Analytic Inequalities
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Kernel-function Based Algorithms for Semidefinite Optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Self-regular functions and new search directions for linear and semidefinite optimization
Cited in
(31)- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- A new primal-dual interior-point algorithm for semidefinite optimization
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- 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
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- A generic kernel function for interior point methods
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- 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
- Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- 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
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new 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
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- A wide neighborhood interior-point algorithm based on the trigonometric kernel 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: 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)
