New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
From MaRDI portal
Publication:4622797
Recommendations
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Interior-point methods based on kernel functions for symmetric optimization
- An interior-point method for symmetric optimization based on a new wide neighborhood
- 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
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 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Jordan-algebraic approach to potential-reduction algorithms
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A new algorithm for solving self-dual linear optimization problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new infeasible interior-point method based on Darvay's technique 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 new primal-dual path-following method for convex quadratic programming
- 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 predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- New interior point algorithms in linear programming
- 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 Self-Scaled Cones
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Similarity and other spectral relations for symmetric cones
Cited in
(8)- Interior-point methods based on kernel functions for symmetric optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Towards non-symmetric conic optimization
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A new corrector-predictor interior-point method for symmetric cone optimization
This page was built for publication: New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622797)
