A Loss Function for Box-Constrained Inverses Problems
Journal Title: Decision Making in Manufacturing and Services - Year 2008, Vol 2, Issue 1
Abstract
A loss function is proposed for solving box-constrained inverse problems. Given causality mechanisms between inputs and outputs as smooth functions, an inverse problem demands to adjust the input levels to make the output levels as close as possible to the target values; box-constrained refers to the requirement that all outcome levels remain within their respective permissible intervals. A feasible solution is assumed known, which is often the status quo. We propose a loss function which avoids activation of the constraints. A practical advantage of this approach over the usual weighted least squares is that permissible outcome intervals are required in place of target importance weights, facilitating data acquisition. The proposed loss function is smooth and strictly convex with closed-form gradient and Hessian, permitting Newton family algorithms. The author has not been able to locate in the literature the Gibbs distribution corresponding to the loss function. The loss function is closely related to the generalized matching law in psychology.
Authors and Affiliations
Kiyoshi Yoneda
Keywords
Related Articles
- EP ID EP422419
- DOI 10.7494/dmms.2008.2.2.79
- Views 59
- Downloads 0
Allocating Pooled Inventory According to Contributions and Entitlements
Inventory pooling, whether by centralization of stock or by mutual assistance, is known to be beneficial when demands are uncertain. But when the retailers are independent, the question is how to divide the benefits of p...
CP-driven Production Process Planning in Multiproject Environment
The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed...
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor’s pe...
On the Non-Symmetric Nash and Kalai-Smorodinsky Bargaining Solutions
Recently in some negotiation application areas the usual assumption that the negotiators are symmetric has been relaxed. In particular, weights have been introduced to the Nash Bargaining Solution to reflect the differe...
A multi-criteria optimization approach to modeling negotiation process
The paper presents a multi-criteria optimization approach to modeling negotiation process. The negotiation process is modeled as a special multi-criteria problem. The method for finding solutions is the interactive selec...