A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
From MaRDI portal
Publication:2245692
DOI10.1007/S11081-020-09516-9zbMATH Open1474.90516OpenAlexW3035157738MaRDI QIDQ2245692FDOQ2245692
Kun Huang, Zhengwei Huang, Mingwang Zhang, Mengmeng Li
Publication date: 15 November 2021
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-020-09516-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix Analysis
- Linear Matrix Inequalities in System and Control Theory
- A new polynomial-time algorithm for linear programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- A new and efficient large-update interior-point method for linear optimization
- A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
- 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
- A mathematical view of interior-point methods in convex optimization
- Handbook of semidefinite programming. Theory, algorithms, and 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
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A polynomial-time algorithm for linear 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
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Kernel-function Based Algorithms for Semidefinite Optimization
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- New complexity analysis of the primal-dual Newton method for linear optimization
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- New parameterized kernel functions for linear optimization
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- An efficient parameterized logarithmic kernel function for linear optimization
- Kernel function based interior-point algorithms for semidefinite optimization
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
Cited In (7)
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2245692)