Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
From MaRDI portal
Publication:5299915
DOI10.1080/10556788.2013.781600zbMath1267.90157MaRDI QIDQ5299915
Publication date: 24 June 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.781600
linear complementarity problem; interior-point methods; polynomial complexity; Nesterov-Todd scaling; Cartesian \(P_{\ast}(\kappa )\)-property; Euclidean Jordan algebra and symmetric cones; full-step updates
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
Unnamed Item, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A new full-NT step interior-point method for circular cone optimization, Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP, A projection and contraction method for symmetric cone complementarity problem, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, A path following interior-point method for linear complementarity problems over circular cones, A generalized smoothing Newton method for the symmetric cone complementarity problem, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, An efficient parameterized logarithmic kernel function for semidefinite optimization, The parameter-Newton iteration for the second-order cone linear complementarity problem, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, An infeasible full NT-step interior point method for circular optimization, Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras, New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
Cites Work
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Cluster synchronization for linearly coupled complex networks
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for 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
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- 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
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On a commutative class of search directions for linear programming over symmetric cones
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Function spaces and reproducing kernels on bounded symmetric domains
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE 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
- Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
