A trajectory-based method for constrained nonlinear optimization problems
DOI10.1007/S10957-018-1274-9zbMATH Open1433.90120OpenAlexW2794607820WikidataQ130047503 ScholiaQ130047503MaRDI QIDQ725880FDOQ725880
Authors: M. Montaz Ali, Terry-Leigh Oliphant
Publication date: 2 August 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1274-9
Recommendations
convergencenumerical integrationsystem of ordinary differential equationsconstrained nonlinear optimizationtrajectory-based method
Cites Work
- A differential-equations algorithm for nonlinear equations
- CUTE
- Numerical Optimization
- Benchmarking optimization software with performance profiles.
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Title not available (Why is that?)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- A new and dynamic method for unconstrained minimization
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Combining search directions using gradient flows
- Steepest descent with curvature dynamical system
- Differential gradient methods
- A new arc algorithm for unconstrained optimization
- Using dynamical systems methods to solve minimization problems
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- Unconstrained Optimization by Approximation of the Gradient Path
- Optimal Order and Stepsize Sequences
Cited In (18)
- Title not available (Why is that?)
- Discrete approximations to optimal trajectories using direct transcription and nonlinear programming
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
- Title not available (Why is that?)
- Constrained derivatives method for solutions of constrained optimization problem
- A unified gradient flow approach to constrained nonlinear optimization problems
- A Flatness-Based Iterative Method for Reference Trajectory Generation in Constrained NMPC
- Tree Based Trajectory Optimization Based on Local Linearity of Continuous Non-Linear Dynamics
- A dynamic penalty function method for the solution of structural optimization problems
- Trajectory generation for the N-trailer problem using Goursat normal form
- Approximate convex hull based scenario truncation for chance constrained trajectory optimization
- Adjoint equations and perturbation algorithms in the optimal trajectory problem
- Title not available (Why is that?)
- Survey of Numerical Methods for Trajectory Optimization
- Constrained motion problems with applications by nonlinear programming methods
- The method of similar trajectories with branching according to parametric maximum of the auxiliary weight
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
- Trust-tech-based global optimization methodology for nonlinear programming
Uses Software
This page was built for publication: A trajectory-based method for constrained nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725880)