A trajectory algorithm based on the gradient method. I: The search on the quasioptimal trajectories

DOI10.1007/BF00130832zbMATH Open0752.90072MaRDI QIDQ1200527FDOQ1200527

Authors: E. G. Sturua, S. K. Zavriev 

Publication date: 16 January 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 994717
• scientific article; zbMATH DE number 757684
• A trajectory-followed method for unconstrained optimization
• On the gradient method in a Hilbert space in the case of nonisolated minima
• On global search in nonconvex optimal control problems

zbMATH Keywords

global optimizationprojected subgradient method\(\varepsilon\)-optimal solutionfinite subgradient algorithmtrajectory algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trajectory nets connecting all critical points of a smooth function

Cited In (3)

• Local search gradient algorithm based on functional voxel modeling
• Search-trajectory optimization. II: Algorithms and computations
• The method of similar trajectories with branching according to parametric maximum of the auxiliary weight

This page was built for publication: A trajectory algorithm based on the gradient method. I: The search on the quasioptimal trajectories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200527)