Coupling the auxiliary problem principle with descent methods of pseudoconvex programming

Article Abstract:

The feasibility of integrating the auxiliary problem method and a descent scheme under a unified framework to solve smooth pseudoconvex minimization problems is investigated. The concept, which requires the selection of an appropriate auxiliary function, enables a nonseparable problem to be decomposed into a series of separable subproblems. It is implemented via a descent type auxiliary problem method which partially linearizes the objective function and converges even under weak conditions.

Optimization theory, Mathematical programming, Convex programming

---

Modeling muddles: validation beyond the numbers

Article Abstract:

Complex model validity can be estimated nonmathematically through the analysis of arguments used by model proponents. Using the expected utility (EU) as a model, it was shown that patterns of reasoning exist that can be used to evaluate the foundations of the model. It was shown that EU proponents used the top-down logical approach while those counter to EU used the empirically-based bottom-up argument.

Model theory

---

Similar abstracts:

• Abstracts: A103 (1997) 18-27 in heavily congested cities. An efficient simplex type algorithm for sparse and dense linear programs
• Abstracts: Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions. The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• Abstracts: A stochastic and dynamic routing policy using branching processes with state dependent immigration. The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: a multiple objective approach
• Abstracts: An enumerative framework for a class of nonlinear integer programming problems. Algorithms for graph partitioning problems by means of eigenspace relaxations
• Abstracts: A neural network for classifying the financial health of a firm. Economic and environmental power dispatch

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.