2017
DOI: 10.1016/s0252-9602(17)30072-3
|View full text |Cite
|
Sign up to set email alerts
|

Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…For this reason, the semismooth Newton method can be used to solve such systems. The concept of the semismooth Newton method has been introduced first by Pang and Qi (1993), Qi (1993) and Qi and Sun (1993) and then developed in many papers and books (Chen et al, 2000; Chi et al, 2017; Hinze et al, 2008; Ito and Kunisch, 2008; Kröner et al, 2011). The semismooth Newton iteration can be stated regarding an active set strategy and the generalized derivatives of the max and min operators.…”
Section: Nsn Methods To Solve the Obtained Bound Constrained Optimizatmentioning
confidence: 99%
“…For this reason, the semismooth Newton method can be used to solve such systems. The concept of the semismooth Newton method has been introduced first by Pang and Qi (1993), Qi (1993) and Qi and Sun (1993) and then developed in many papers and books (Chen et al, 2000; Chi et al, 2017; Hinze et al, 2008; Ito and Kunisch, 2008; Kröner et al, 2011). The semismooth Newton iteration can be stated regarding an active set strategy and the generalized derivatives of the max and min operators.…”
Section: Nsn Methods To Solve the Obtained Bound Constrained Optimizatmentioning
confidence: 99%