A trajectory-based method for constrained nonlinear optimization problems
From MaRDI portal
Publication:725880
Recommendations
- A trajectory-based method for mixed integer nonlinear programming problems
- Solving constrained global optimization problems without penalty parameters
- scientific article; zbMATH DE number 994717
- A nonmonotonic trust region method for constrained optimization problems
- scientific article; zbMATH DE number 740463
Cites work
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- A differential-equations algorithm for nonlinear equations
- A new and dynamic method for unconstrained minimization
- A new arc algorithm for unconstrained optimization
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Benchmarking optimization software with performance profiles.
- Combining search directions using gradient flows
- CUTE
- Differential gradient methods
- scientific article; zbMATH DE number 778134 (Why is no real title available?)
- More test examples for nonlinear programming codes
- Numerical Optimization
- Optimal Order and Stepsize Sequences
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Steepest descent with curvature dynamical system
- Test examples for nonlinear programming codes
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Unconstrained Optimization by Approximation of the Gradient Path
- Using dynamical systems methods to solve minimization problems
Cited in
(20)- A dynamic penalty function method for the solution of structural optimization problems
- A trajectory-based method for mixed integer nonlinear programming problems
- A unified gradient flow approach to constrained nonlinear optimization problems
- Constrained motion problems with applications by nonlinear programming methods
- Differential equation method based on approximate augmented Lagrangian for nonlinear programming
- Approximate convex hull based scenario truncation for chance constrained trajectory optimization
- Tree Based Trajectory Optimization Based on Local Linearity of Continuous Non-Linear Dynamics
- Constrained derivatives method for solutions of constrained optimization problem
- scientific article; zbMATH DE number 994717 (Why is no real title available?)
- A Flatness-Based Iterative Method for Reference Trajectory Generation in Constrained NMPC
- Survey of Numerical Methods for Trajectory Optimization
- scientific article; zbMATH DE number 3926409 (Why is no real title available?)
- Discrete approximations to optimal trajectories using direct transcription and nonlinear programming
- Adjoint equations and perturbation algorithms in the optimal trajectory problem
- Trajectory generation for the N-trailer problem using Goursat normal form
- The method of similar trajectories with branching according to parametric maximum of the auxiliary weight
- Trust-tech-based global optimization methodology for nonlinear programming
- scientific article; zbMATH DE number 5066284 (Why is no real title available?)
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
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)
