An infeasible full NT-step interior point method for circular optimization
From MaRDI portal
Publication:2360232
Recommendations
- A full Nesterov-Todd step interior-point method for circular cone optimization
- A new full-NT step interior-point method for circular cone optimization
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
Cites work
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A full Nesterov-Todd step interior-point method for circular cone optimization
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An improved and modified infeasible interior-point method for symmetric optimization
- An improved and simplified full-Newton step \(O(n)\) infeasible interior-point method for linear optimization
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
- Constructions of complementarity functions and merit functions for circular cone complementarity problem
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-dual path-following algorithms for circular programming
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- The Jordan algebraic structure of the circular cone
- Variational analysis of circular cone programs
- Variational inequality formulation of circular cone eigenvalue complementarity problems
Cited in
(5)- A full Nesterov-Todd step interior-point method for circular cone optimization
- Improved convergence analysis of a smoothing Newton method for the circular cone programming
- A new full-NT step interior-point method for circular cone optimization
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
This page was built for publication: An infeasible full NT-step interior point method for circular optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360232)
