Matches in SemOpenAlex for { <https://semopenalex.org/work/W2004000050> ?p ?o ?g. }
Showing items 1 to 64 of
64
with 100 items per page.
- W2004000050 abstract "Optimization methods are all implemented with the hypothesis of unknowing the mathematic express of objective objection. Using the human analogy innovative method, the one-dimension blind-walking optimal method is proposed in this paper. The theory and the algorithm of this method includes halving, doubling, reversing probing step and verifying the applicability condition. Double-step is available to make current point moving to the extremum point. Half-step is available to accelerate convergence. In order to improve the optimization, the applicability condition decides whether update current point or not. The operation process, algorithmic flow chart and characteristic analysis of the method were given. Two optimization problems with unimodal or multimodal objective function were solved by the proposed method respectively. The simulation result shows that the proposed method is better than the ordinary method. The proposed method has the merit of rapid convergence, little calculation capacity, wide applicable range, etc. Taking the method as innovative kernel, the random research method, feasible direction method and complex shape method were improved. Taking the innovative content of this paper as innovative kernel, a monograph was published. The other innovations of the monograph are listed, such as applied algorithm of Karush-Kuhn-Tucker (KKT) qualifications on judging the restriction extremum point, the design step of computing software, the complementarity and derivation of Powell criterion, the method of keeping the complex shape not to deduce dimension and the analysis of gradual optimization characteristic, the reinforced wall of inner point punish function method, the analysis of problem with constrained monstrosity extremum point, the improvement of Newton method and the validation of optimization idea of blind walking repeatedly, the explanation of later-day optimization method, the conformity of seeking algorithm needing the objective function derivation, etc." @default.
- W2004000050 created "2016-06-24" @default.
- W2004000050 creator A5006388341 @default.
- W2004000050 date "2010-12-01" @default.
- W2004000050 modified "2023-09-26" @default.
- W2004000050 title "Blindman-Walking Optimization Method" @default.
- W2004000050 doi "https://doi.org/10.4304/jnw.5.12.1458-1466" @default.
- W2004000050 hasPublicationYear "2010" @default.
- W2004000050 type Work @default.
- W2004000050 sameAs 2004000050 @default.
- W2004000050 citedByCount "0" @default.
- W2004000050 crossrefType "journal-article" @default.
- W2004000050 hasAuthorship W2004000050A5006388341 @default.
- W2004000050 hasConcept C11413529 @default.
- W2004000050 hasConcept C126255220 @default.
- W2004000050 hasConcept C162324750 @default.
- W2004000050 hasConcept C202444582 @default.
- W2004000050 hasConcept C2524010 @default.
- W2004000050 hasConcept C2777303404 @default.
- W2004000050 hasConcept C28719098 @default.
- W2004000050 hasConcept C33676613 @default.
- W2004000050 hasConcept C33923547 @default.
- W2004000050 hasConcept C41008148 @default.
- W2004000050 hasConcept C50454189 @default.
- W2004000050 hasConcept C50522688 @default.
- W2004000050 hasConceptScore W2004000050C11413529 @default.
- W2004000050 hasConceptScore W2004000050C126255220 @default.
- W2004000050 hasConceptScore W2004000050C162324750 @default.
- W2004000050 hasConceptScore W2004000050C202444582 @default.
- W2004000050 hasConceptScore W2004000050C2524010 @default.
- W2004000050 hasConceptScore W2004000050C2777303404 @default.
- W2004000050 hasConceptScore W2004000050C28719098 @default.
- W2004000050 hasConceptScore W2004000050C33676613 @default.
- W2004000050 hasConceptScore W2004000050C33923547 @default.
- W2004000050 hasConceptScore W2004000050C41008148 @default.
- W2004000050 hasConceptScore W2004000050C50454189 @default.
- W2004000050 hasConceptScore W2004000050C50522688 @default.
- W2004000050 hasLocation W20040000501 @default.
- W2004000050 hasOpenAccess W2004000050 @default.
- W2004000050 hasPrimaryLocation W20040000501 @default.
- W2004000050 hasRelatedWork W1497074676 @default.
- W2004000050 hasRelatedWork W1992877709 @default.
- W2004000050 hasRelatedWork W1998929942 @default.
- W2004000050 hasRelatedWork W2020903001 @default.
- W2004000050 hasRelatedWork W2028307454 @default.
- W2004000050 hasRelatedWork W2073773747 @default.
- W2004000050 hasRelatedWork W2076803070 @default.
- W2004000050 hasRelatedWork W2087783952 @default.
- W2004000050 hasRelatedWork W2089938274 @default.
- W2004000050 hasRelatedWork W2090861701 @default.
- W2004000050 hasRelatedWork W2125677506 @default.
- W2004000050 hasRelatedWork W2134401588 @default.
- W2004000050 hasRelatedWork W2157875558 @default.
- W2004000050 hasRelatedWork W2350486682 @default.
- W2004000050 hasRelatedWork W2350629169 @default.
- W2004000050 hasRelatedWork W2370902127 @default.
- W2004000050 hasRelatedWork W2376787183 @default.
- W2004000050 hasRelatedWork W3033128394 @default.
- W2004000050 hasRelatedWork W3130995516 @default.
- W2004000050 hasRelatedWork W777315295 @default.
- W2004000050 isParatext "false" @default.
- W2004000050 isRetracted "false" @default.
- W2004000050 magId "2004000050" @default.
- W2004000050 workType "article" @default.