convex programming problem
Mask-Constrained Power Synthesis of Large and Arbitrary Arraysas a Few-Samples Global Optimization
... a Convex Programming problem and the external optimization deals with a reduced number of unknowns, a full control of the shaped beam’s ripple and sidelobe level is achieved even in the case of ...
13
Stability in E convex programming
... Abstract. We define and analyze two kinds of stability in E-convex programming problem in which the feasible domain is affected by an operator E. The first kind of this stability is that the set of all ...
6
Chebyshev Approximate Solution to Allocation Problem in Multiple Objective Surveys with Random Costs
... allocation problem in multivariate surveys as a convex programming problem with non-linear objective functions and a single stochastic cost ...constrained programming. The resulting ...
5
Duality without constraint qualification in nonsmooth optimization
... optimization problem with inequal- ity ...alized convex functions based on the generalized directional ...dual problem corresponding to the primal problem, and some duality results are ...
11
Extragradient method for convex minimization problem
... point problem of a strict pseudocontraction by combining Korpelevich’s extragra- dient method, the viscosity approximation method, the hybrid steepest-descent method, Mann’s iteration method, and the ...
40
Equivalent properties of global weak sharp minima with applications
... When C is negative orthant, the concept of global error bounds for affine convex inclusion is also referred to as Hoffman bounds in honor of his seminal work [17]. His- torically, this is the most intensively ...
9
Optimality for \(E\mbox{ }[0,1]\) convex multi objective programming problems
... where the above inequalities hold because f , g are E-[, ] convex at x ∗ with respect to the same E (see Theorem . in []). Thus, x ∗ is the minimizer of f (x) under the constraint g(x) ≤ , which implies that ...
18
Evolutionary Programming Techniques for Solving Non Convex Economic Load Dispatch Problem with Valve Point Loading Effect
... The Differential evolution (DE) is a stochastic population-based algorithm that was used for searching the optimum solution of ELD problems. The advantages of DE are simplicity, efficiency, and use of real coding. It ...
11
An active set algorithm for a class of linear complementarity problems arising from rigid body dynamics
... Active-set methods originated as extensions of the simplex method for solving LPs. The basic idea of active-set methods is to fix a working set, a maximal linearly independent subset of the active constraints, and to ...
14
A New Method Evaluating Credit Risk with ES Based LS SVM MK
... So the minimum of 1 can guarantee e 1 in a lower level. And it improves the robustness for the final solution. It can be found that above linear programming formulation and its dual description is equivalent ...
6
MULTI LEVEL GROUP KEY MANAGEMENT TECHNIQUE FOR MULTICAST SECURITY IN MANET
... bilevel programming problem is a special class of nonlinear bilevel programming problems, because all of its objective function is convex quadratic function, all the constraint functions are ...
7
Convex Programming Based Phase Retrieval: Theory and Applications
... including convex optimization, signal processing and entropy vectors, have significantly increased because of ...exceptional problem solving abilities, teaching qualities and deep understanding of a wide ...
150
Properties of Answer Set Programming with Convex Generalized Atoms
... In this section, we examine in detail how the FLP and PSP semantics relate. We shall proceed in three steps. First, we formally prove that FLP and PSP semantics coincide on programs with convex structures in ...
14
Optimality and mixed duality in multiobjective E convex programming
... primal problem is given. Under the assumption of the E-convex conditions, weak and strong duality theorems between the primal and dual problems are established, and we also propose some examples to ...
13
Solving A Fractional Program with Second Order Cone Constraint
... cone programming (SOCP) problems are con- vex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of sec- ond order (Lorentz) ...
10
Duality in nonlinear programming problems under fuzzy environment with exponential membership functions
... The paper is organized as follows. In Sect. 2, we construct a general fuzzy nonlinear programming problem and formulate its Mangasarian type dual. Further, we prove duality theorems using exponential ...
10
Convergence theorems for split equality generalized mixed equilibrium problems for demi contractive mappings
... Let F : C × C −→ R and G : Q × Q −→ R be two nonlinear bi-mappings, T : C −→ C and S : Q −→ Q be two nonlinear mappings, and φ : C −→ R ∪ { + ∞} and ϕ : Q −→ R ∪ { + ∞} be proper lower semicontinuous and convex ...
25
Fekete Szegö Problem for a New Class of Analytic Functions
... which are analytic in the open unit disk U {z : z ∈ C and |z| < 1} and S denote the subclass of A that are univalent in U. A function fz in A is said to be in class S ∗ of starlike functions of order zero in U, if Rzf ...
6
Higher Order Duality for Minimax Fractional Type Programming Involving Symmetric Matrices
... [2] S. Tanimoto, “Duality for a Class of Nondifferentiable Ma thematical Programming Problems,” Journal of Ma- thematical Analysis and Applications, Vol. 79, No. 2, 1981, pp. 286-294. ...
6
Norm–Based Approximation in Invex Multi- Objective Programming Problems
... traditional programming but also in multi-objective ...multi-objective programming problem and extend invex functions to the so called cone invex functions and derive some results about ...
5