Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
From MaRDI portal
Publication:5516542
Cited in
(15)- Chebyshev approximation by H-polynomials: A numerical method
- Preliminary estimators for robust non-linear regression estimation
- Approximation methods for the unconstrained optimization
- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- A PSO-based computational framework to design active noise cancelation systems for smart vehicle enclosures
- An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Regulatorabschätzungen für total reelle algebraische Zahlkörper
- Locating facilities in three‐dimensional space by convex programming
- A computational comparison of some non-linear programs
- Solving Engineering Optimization Problems Without Penalty
- A language for nonlinear programming problems
- Penalty methods for mathematical programming in \(E^n\) with general constraint sets
- Optimal transshipment of products
- An optimal control problem for a class of distributed parameter systems
This page was built for publication: Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516542)