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

DOI10.1007/BF00130832MaRDI QIDQ1200527zbMATH OpenFDO

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

Publication date 16 January 1993

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

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)

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

Cites work

• scientific article; zbMATH DE number 3426803 (Why is no real title available?)
• scientific article; zbMATH DE number 3700567 (Why is no real title available?)
• scientific article; zbMATH DE number 3490340 (Why is no real title available?)
• Trajectory nets connecting all critical points of a smooth function
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations

Cited in

(3)

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

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)