A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
From MaRDI portal
Publication:5745170
Recommendations
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- New method for determining search directions for interior-point algorithms in linear optimization
- Interior-point algorithm for linear optimization based on a new search direction
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
Cites work
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A new algorithm for solving self-dual linear optimization problems
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new polynomial-time algorithm for linear programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Barrier Functions in Interior Point Methods
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- EP theorem for dual linear complementarity problems
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- New interior point algorithms in linear programming
- New method for determining search directions for interior-point algorithms in linear optimization
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Self-regular interior-point methods for semidefinite optimization
- Semidefinite Programming
- Similarity and other spectral relations for symmetric cones
- The accuracy of interior-point methods based on kernel functions
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
Cited in
(13)- Interior-point algorithm for linear programming based on a new descent direction
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- Solving American option optimal control problems in financial markets using a novel neural network
- New method for determining search directions for interior-point algorithms in linear optimization
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Power classes of search directions and dualistic structure on symmetric cones
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- Real-time optimal energy management for a fuel cell/battery hybrid system
This page was built for publication: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745170)
