A general method for solving constrained optimization problems
From MaRDI portal
A general problem of constrained minimization is studied. The minima are determined by searching for the asymptotical values of the solutions of a suitable system of ordinary differential equations. For this system, if the initial point is feasible, then any trajectory is always inside the set of constraints and tends towards a set of critical points. Each critical point that is not a relative minimum is unstable. For formulas of one-step numerical integration, an estimate of the step of integration is given, so that the above mentioned qualitative properties of the system of ordinary differential equations are kept.
Recommendations
- Generalized Solutions of Constrained Optimization Problems
- A hybrid method for solving general constrained optimization problems
- scientific article; zbMATH DE number 3963580
- A compromise method in constrained optimization problems
- scientific article; zbMATH DE number 4070673
- A method of solving constrained stochastic optimization problems
- A hybrid approach to constrained optimization problems
- scientific article; zbMATH DE number 3914081
- A constrained optimization approach to solving certain systems of convex equations
Cites work
- A Newton-type curvilinear search method for constrained optimization
- A relaxation method for solving problems of non-linear programming
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints
- Differential gradient methods
- scientific article; zbMATH DE number 3649921 (Why is no real title available?)
- scientific article; zbMATH DE number 3777320 (Why is no real title available?)
- scientific article; zbMATH DE number 3496458 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3567252 (Why is no real title available?)
- scientific article; zbMATH DE number 3334605 (Why is no real title available?)
- scientific article; zbMATH DE number 3353123 (Why is no real title available?)
- scientific article; zbMATH DE number 3355507 (Why is no real title available?)
- scientific article; zbMATH DE number 3423824 (Why is no real title available?)
- scientific article; zbMATH DE number 3078897 (Why is no real title available?)
- Nonlinear programming codes. Information, tests, performance
- Test example for nonlinear programming codes
Cited in
(25)- Constrained optimization: Projected gradient flows
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Optimization algorithms based on solving an equation which contains a reachability function
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT
- Trajectory-following algorithms for min-max optimization problems
- A practical and efficient approach to the constrained via minimization problem
- Using dynamical systems methods to solve minimization problems
- Solving reachability problems by a scalable constrained optimization method
- On Solving Optimization Problems with Ordered Average Criteria and Constraints
- Gradient transformation trajectory following algorithms for equality-constrained minimization
- Constrained optimization: A general tolerance approach
- Solving constrained optimization problems by solution-based decomposition search
- scientific article; zbMATH DE number 3844952 (Why is no real title available?)
- scientific article; zbMATH DE number 3860900 (Why is no real title available?)
- scientific article; zbMATH DE number 124136 (Why is no real title available?)
- scientific article; zbMATH DE number 2068062 (Why is no real title available?)
- scientific article; zbMATH DE number 2084716 (Why is no real title available?)
- A dynamical systems approach to constrained minimization
- scientific article; zbMATH DE number 2154767 (Why is no real title available?)
- Asymptotical well behaviour for constrained minimisation problems
- One-step and multistep procedures for constrained minimization problems
- Shortest path problem with ordinary differential equations constrained
- A new solving procedure by m-M calculus for problems of constrained optimization
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Constraint incorporation in optimization
This page was built for publication: A general method for solving constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058991)
