Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
From MaRDI portal
Publication:2358845
DOI10.3934/jimo.2012.8.67zbMath1364.90246OpenAlexW2314132973MaRDI QIDQ2358845
Publication date: 16 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2012.8.67
Semidefinite programming (90C22) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP ⋮ Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some P-properties for linear transformations on Euclidean Jordan algebras
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Analysis of a smoothing method for symmetric conic linear programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Pseudo-monotone complementarity problems in Hilbert space
- 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
- Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- \(P_ *\)-matrices are just sufficient
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
