A semi-smooth Newton method is developed for nonlinear conic programs over generalized simplicial cones, with local quadratic convergence proven via conic projection equations and strong semi-smoothness of the projection operator.
and Silveira, T.P.: First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition.Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones
A semi-smooth Newton method is developed for nonlinear conic programs over generalized simplicial cones, with local quadratic convergence proven via conic projection equations and strong semi-smoothness of the projection operator.