A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
From MaRDI portal
Publication:5745170
DOI10.1080/02331934.2018.1432610zbMath1400.90304OpenAlexW2794102933MaRDI QIDQ5745170
Petra-Renáta Takács, Zsolt Darvay
Publication date: 5 June 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1432610
Related Items
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Interior-point algorithm for linear programming based on a new descent direction, Real‐time optimal energy management for a fuel cell/battery hybrid system, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- New method for determining search directions for interior-point algorithms in linear optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new polynomial-time algorithm for linear programming
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- EP theorem for dual linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Similarity and other spectral relations for symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- The accuracy of interior-point methods based on kernel functions
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Self-Regular Interior-Point Methods for Semidefinite Optimization
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Semidefinite Programming
- Interior-point methods for CartesianP*(κ)-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
- A Jordan-algebraic approach to potential-reduction algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
