Results 101 to 110 of about 124 (120)
Some of the next articles are maybe not open access.
2014
In this chapter we introduce nonlinear scalarization methods that are very important from the theoretical as well as computational point of view. We introduce different scalarizing functionals and discuss their properties, especially monotonicity, continuity, Lipschitz continuity, sublinearity, convexity.
Akhtar A. Khan +2 more
openaire +1 more source
In this chapter we introduce nonlinear scalarization methods that are very important from the theoretical as well as computational point of view. We introduce different scalarizing functionals and discuss their properties, especially monotonicity, continuity, Lipschitz continuity, sublinearity, convexity.
Akhtar A. Khan +2 more
openaire +1 more source
IEEE Transactions on Automatic Control, 1993
An interesting nonconvex Kharitonov region considered by M. Fu (1991) is reviewed. It is shown that by means of a counterexample that the region identified is not a Kharitonov region. A different nonconvex Kharitonov region is proposed. >
Soh, Y. C., Foo, Y. K.
openaire +2 more sources
An interesting nonconvex Kharitonov region considered by M. Fu (1991) is reviewed. It is shown that by means of a counterexample that the region identified is not a Kharitonov region. A different nonconvex Kharitonov region is proposed. >
Soh, Y. C., Foo, Y. K.
openaire +2 more sources
Nonconvex process optimization
Computers & Chemical Engineering, 1996Abstract Difficulties associated with nonconvexity in successive quadratic programming (SQP) methods are studied. It is shown that projected indefiniteness of the Hessian matrix of the Lagrangian function can (i) place restrictions on the order in which inequalities can be added or deleted from the active set, (ii) generate redundant active sets ...
A. Lucia, J. Xu, K.M. Layn
openaire +1 more source
2017
This chapter gives an overview of relaxation methods for solving nonconvex and intractable robust optimization problems for allocating resources in wireless networks. We begin by presenting a taxonomy of relaxation methods that have been widely used in this context and continue by giving several examples to demonstrate how such methods are utilized in ...
Saeedeh Parsaeefard +2 more
openaire +1 more source
This chapter gives an overview of relaxation methods for solving nonconvex and intractable robust optimization problems for allocating resources in wireless networks. We begin by presenting a taxonomy of relaxation methods that have been widely used in this context and continue by giving several examples to demonstrate how such methods are utilized in ...
Saeedeh Parsaeefard +2 more
openaire +1 more source
Journal of Applied Analysis, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benabdellah H. +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benabdellah H. +3 more
openaire +2 more sources
Nonconvex Quadratic Programming
1998Nonconvex quadratic programming deals with optimization problems described by means of linear and quadratic functions, i.e., functions with lowest degree of nonconvexity. One of the earliest significant results in this area is the celebrated S-Lemma of Yakubovich which plays a major role in the development of quadratic optimization.
openaire +1 more source
Nonconvexity and Microstructure
2015Infinite-dimensional minimization problems without convexity properties may lead to the nonexistence of solutions, but arise as simplified mathematical descriptions of crystalline phase transitions that enable the shape-memory effect of smart materials.
openaire +1 more source
1997
We have seen in the previous chapter that the weak lower semicontinuity property is crucial in order to employ the direct method of the calculus of variations to find minimizers of variational principles. This property is inherited by functionals whose integrands enjoy the appropriate convexity. Nonetheless, for an ever increasing number of interesting
openaire +1 more source
We have seen in the previous chapter that the weak lower semicontinuity property is crucial in order to employ the direct method of the calculus of variations to find minimizers of variational principles. This property is inherited by functionals whose integrands enjoy the appropriate convexity. Nonetheless, for an ever increasing number of interesting
openaire +1 more source
Nonconvex bargaining problems [PDF]
, 2004 This paper studies compact and comprehensive bargaining problems for n players and axiomatically characterize the extensions of the three classical bargaining solutions to nonconvex bargaining problems: the Nash solution, the egalitarian solution and the Kalai-Smorodinsky solution.
Xu, Yongsheng, Yoshihara, Naoki
openaire