Rationality and Solutions to Nonconvex Bargaining Problems: Rationalizable, Asymmetric and Nash Solutions [PDF]
Conditions α and β are two well-known rationality conditions in the theory of rational choice. This paper examines the implications of weaker versions of these two rationality conditions in the context of solutions to nonconvex bargaining problems. It is
Yoshihara, Naoki, Xu, Yongsheng
core
Proportional Nash solutions - A new and procedural analysis of nonconvex bargaining problems [PDF]
This paper studies the Nash solution to nonconvex bargaining problems. The Nash solution in such a context is typically multi-valued. We introduce a procedure to exclude some options recommended by the Nash solution. The procedure is based on the idea of
Yoshihara, Naoki, Xu, Yongsheng
core
An Interior-Point algorithm for Nonlinear Minimax Problems [PDF]
We present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex.
E. Obasanjo, G. Tzallas-Regas, B. Rustem
core
Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]
We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem +2 more
core
Domain-independent programming by demonstration in existing applications [PDF]
, 2001 This paper describes Familiar, a domain- independent programming by demonstration system for automating iterative tasks in existing, unmodified applications on a popular commercial platform.
Paynter, Gordon W. +3 more
core +1 more source
Immunizing Conic Quadratic Optimization Problems Against Implementation Errors [PDF]
We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints.
Ben-Tal, A., Hertog, D. den
core
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey [PDF]
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as ...
Klerk, E. de
core
An Improved Geometric Programming Approach for Optimization of Biochemical Systems
Journal of Applied Mathematics, 2014 This paper proposes an improved geometric programming approach to address the optimization of biochemical systems. In the proposed method we take advantage of a special and interesting class of nonlinear kinetic models known as generalized mass action ...
Gongxian Xu, Lei Wang
doaj +1 more source
A New Nonconvex quadratic programming Technique: Practical and Fast Solver Method [PDF]
, 2019 There exist many problems that nonconvex which are hard to solve. To overcome the nonconvexity of the problems, this paper presents a novel YALMIP-based nonconvex quadratic programming model to overcome the nonconvex problem.
Tashakor, Behnam, Soltani, Ali
core +2 more sources
Stochastic dual dynamic programming applied to nonconvex hydrothermal models [PDF]
, 2012 Artículos en revistasIn this paper we apply stochastic dual dynamic programming decomposition to a nonconvex multistage stochastic hydrothermal model where the nonlinear water head effects on production and the nonlinear dependence between the reservoir ...
Cerisola Lopez De Haro, Santiago +2 more
core