A path following interior-point method for linear complementarity problems over circular cones
From MaRDI portal
Publication:1630229
DOI10.1007/s13160-018-0317-9zbMath1471.90151OpenAlexW2809449397MaRDI QIDQ1630229
Publication date: 7 December 2018
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-018-0317-9
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems., Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones, Optimality conditions for circular cone complementarity programs, Improved convergence analysis of a smoothing Newton method for the circular cone programming
Cites Work
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Smooth and nonsmooth analyses of vector-valued functions associated with circular cones
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- Two classes of merit functions for the second-order cone complementarity problem
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Circular cone convexity and some inequalities associated with circular cones
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Primal-dual path-following algorithms for circular programming
- Variational analysis of circular cone programs
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Towards non-symmetric conic optimization
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- The Jordan algebraic structure of the circular cone
- An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
