A smoothing Newton algorithm for circular cone programming
From MaRDI portal
Publication:3132468
zbMATH Open1389.90261MaRDI QIDQ3132468FDOQ3132468
Authors: Hongjin Wei, Bo Liu, Xiaoni Chi, Zhongping Wan
Publication date: 29 January 2018
Recommendations
- A smoothing Newton algorithm for circular cone programming
- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- A nonmonotone smoothing Newton method for circular cone programming
- Improved convergence analysis of a smoothing Newton method for the circular cone programming
- A nonmonotone inexact smoothing Newton method for linear circular cone complementarity problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Cited In (9)
- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- A self-concordant interior point algorithm for nonsymmetric circular cone programming
- A smoothing Newton algorithm for circular cone programming
- A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones
- A semismooth Newton method for nonlinear symmetric cone programming
- A nonmonotone smoothing Newton method for circular cone programming
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
- A new non-interior point algorithm for circular cone programming
- Improved convergence analysis of a smoothing Newton method for the circular cone programming
This page was built for publication: A smoothing Newton algorithm for circular cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132468)