2021
DOI: 10.21203/rs.3.rs-1102775/v1
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Continuation Newton methods with deflation techniques and  quasi-genetic evolution for global optimization problems

Abstract: The global minimum point of an optimization problem is of interest in engineering fields and it is difficult to be solved, especially for a nonconvex large-scale optimization problem. In this article, we consider the continuation Newton method with the deflation technique and the quasi-genetic evolution for this problem. Firstly, we use the continuation Newton method with the deflation technique to find the stationary points from several determined initial points as many as possible. Then, we use those found s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 42 publications
(74 reference statements)
0
3
0
Order By: Relevance
“…The proposed approach uses a concept known in mathematics as the deflation technique (DT) [2,[51][52][53][54][55]. The theoretical foundations of DT are given in [51].…”
Section: Deflation Technique (Dt)mentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed approach uses a concept known in mathematics as the deflation technique (DT) [2,[51][52][53][54][55]. The theoretical foundations of DT are given in [51].…”
Section: Deflation Technique (Dt)mentioning
confidence: 99%
“…Huang et al proposed using DT to find eigenvalues in dispersive metallic photonic crystals [54]. Luo and Xiao presented an optimization method composed of DT, the continuation method, and quasi-genetic evolution [55]. Article [2] proposes a method for finding multiple operating points using the deflation technique and the SPICE simulator.…”
Section: Deflation Technique (Dt)mentioning
confidence: 99%
“…Another issue is how to adaptively adjust the time step ∆t k at every iteration. A popular and efficient time-stepping control is based on the trust-region updating strategy [9,12,27,[33][34][35][36][37][38][39][40][41]58]. Its main idea can be described as follows.…”
Section: The Time-stepping Control and The Initial Point Selectionmentioning
confidence: 99%