unconstrained optimization problem

unconstrained optimization problem

[¦ən·kən′strānd ‚äp·tə·mə′zā·shən ‚präb·ləm]
(mathematics)
A nonlinear programming problem in which there are no constraint functions.
References in periodicals archive ?
The basic idea of these methods is to change, modify or convert the constrained optimization problem into an unconstrained optimization problem by adding or subtracting a penalty value to or from the objective (Ashok and Chandrugupta, 2011).
This is a solution of the unconstrained optimization problem.
According to [31], the dual function is defined as an unconstrained minimization of the Lagrangian, and the constrained optimization (18) can now be solved via the unconstrained optimization problem
In this work, to solve our formulated constrained optimization problem we have converted it into an unconstrained optimization problem by penalty function technique.
Under this model, the AAPS problem can be transformed into an unconstrained optimization problem.
In this way the constrained optimization problem is converted into unconstrained optimization problem, and DE can be directly applied to antenna synthesis without any modification.
By the penalty method, the formulas (1)-(4) can be transformed into an unconstrained optimization problem
1992) solved an unconstrained optimization problem.
The unconstrained optimization problem is thus defined mathematically as:
In particular, if all the bounds are infinite then Problem (1) reduces to an unconstrained optimization problem.
This article describes a software package for solving the unconstrained optimization problem
The genetic algorithm is a method for solving both constrained and unconstrained optimization problems that is based on natural selection, the process that drives biological evolution.