Results 71 to 80 of about 1,124 (204)
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core
Global optimization of generalized geometric programming [PDF]
, 2004 In this paper a deterministic global optimization algorithm is proposed for locatingthe global minimum of the generalized geometric programming (GGP) problem.
Wang, Yanjun, Gao, Yuelin, Zhang, Kecun
core +1 more source
SciThis paper addresses the simultaneous feeder routing and conductor sizing problem in unbalanced three-phase distribution systems, formulated as a nonconvex mixed-integer nonlinear program (MINLP) that minimizes the equivalent annualized expansion cost ...
Brandon Cortés-Caicedo +4 more
doaj +1 more source
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
, 2005 In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value. The approach is based on the solution of a semidefinite program (SDP) and a convex quadratic program (QP).
openaire +1 more source
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 2, August 2026.ABSTRACT It is common in many real‐world scenarios for decisions to be made on behalf of others. However, Multicriteria Decision Aiding methods often implicitly assume that the person whose preferences operate the methods, known as the decision‐maker, is the source of those preferences.
Maura E. Halstead +3 more
wiley +1 more source
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
Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization [PDF]
Reverse convex programming (RCP) represents an important class of global optimization problems consisting of concave cost and inequality constraint functions.
Bunin, Gene
core +1 more source
Optimizing condition numbers [PDF]
, 2009 In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Maréchal, Pierre, Ye, Jane
core +1 more source
Oligopolistic Banking Sector of Mongolia and Polymatrix Games of Three Players
Известия Иркутского государственного университета: Серия "Математика", 2015 A problem of competition between the three largest banks of the Mongolia major crediting sector is investigated. Modeling of the conflict is carried out using the apparatus of three person polymatrix games (hexamatrix games).
A.V. Orlov, S. Batbileg
doaj
Journal of Microscopy, Volume 303, Issue 2, Page 194-215, August 2026.Abstract Grain identification in polycrystalline nanoparticles, for example, determining which crystal phases are present at each spatial location, is fundamental to materials characterisation. This is particularly challenging when grains overlap extensively, as commonly occurs in four‐dimensional scanning transmission electron microscopy (4D‐STEM ...
Wei Liu +5 more
wiley +1 more source