Effective method for constrained minimum - reverse bridge theorem
From MaRDI portal
Recommendations
- Reverse bridge theorem under constraint partition
- Efficient algorithms for the minimum diameter bridge problem
- scientific article; zbMATH DE number 1786529
- A practical and efficient approach to the constrained via minimization problem
- Constrained minimax method
- Minimal conversely consistent extension of the men-optimal solution
- scientific article; zbMATH DE number 3293978
- A branch-and-bound method for a reverse convex programming problem
- On an approach to the construction of algorithms for constrained minimization
- On minimum configuration Rosenbrock methods
Cites work
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- Temporal planning using subgoal partitioning and resolution in SGPlan
Cited in
(2)
This page was built for publication: Effective method for constrained minimum - reverse bridge theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389506)