Results 231 to 240 of about 10,375 (260)

An alternative account of the minimal counterintuitiveness effect

Cognitive Systems Research, 2010
This paper outlines two approaches to account for the finding that concepts that are minimally counterintuitive are better remembered than intuitive or maximally counterintuitive concepts. The first approach considers such memory advantages to be a property of the concepts themselves while the second approach emphasizes the role played by the context ...
openaire   +2 more sources

An alternate implementation of Goldfarb's minimization algorithm

Mathematical Programming, 1975
Goldfarb's algorithm, which is one of the most successful methods for minimizing a function of several variables subject to linear constraints, uses a single matrix to keep second derivative information and to ensure that search directions satisfy any active constraints.
openaire   +2 more sources

Sampling of Alternatives in Random Regret Minimization Models

Transportation Science, 2016
Sampling of alternatives is often required in discrete choice models to reduce the computational burden and to avoid describing a large number of attributes. This approach has been used in many areas, including modeling of route choice, vehicle ownership, trip destination, residential location, and activity scheduling.
Cristian Angelo Guevara, Caspar G. Chorus, Moshe E. Ben-Akiva   +2 more
openaire   +5 more sources

Multi-way alternating minimization

Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
In a K-way minimization problem, we are interested in finding min (x/sub 1//spl isin/S/sub 1/) /spl middot//spl middot//spl middot/ min (x/sub K//spl isin/S/sub K/) f(x/sub 1/, /spl middot//spl middot//spl middot/, x/sub K/), where f is continuous and bounded from below, and S/sub i/ is a compact convex set in IR(n/sub i/), 1/spl les/i/spl les/K.
R.W. Yeung, T. Berger
openaire   +1 more source

Nonconvex theorems of the alternative and minimization

Optimization, 1987
Theorems of the alternative, in particular, Gordan and Motzkin type theorems for non-convex functions are presented, based on the Fuchssterner and Konig's extended minimax theorem. As applications of these theorems, optimality conditions and duality theorems are obtained for non-convex programming problems.
B.D. Craven, J. Gwinner, V. Jeyakumar
openaire   +1 more source

Alternate minimization gradient method

IMA Journal of Numerical Analysis, 2003
The authors propose a modified steepest descent method so-called the ``alternate minimization (AM) gradient method''. Strictly convex quadratic, the AM method is proved to be \(Q\)-superlinearly convergent in two dimensions, and \(Q\)-linearly convergent in any dimension.
Dai, Yuhong, Yuan, Yaxiang
openaire   +2 more sources

Alternating Proximal Gradient Method for Convex Minimization

Journal of Scientific Computing, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Minimal representations of alternating vowels

Lingua, 2009
Abstract The representations of morphosyntactic variants with alternating stem vowels have been extensively investigated in theoretical and psycholinguistic accounts. This paper argues for representational minimalism of stem vowels which undergo umlaut (i.e. fronting) in certain morphosyntactic categories (e.g. German plural [œ] vs.
openaire   +1 more source

Metalearning-Based Alternating Minimization Algorithm for Nonconvex Optimization

IEEE Transactions on Neural Networks and Learning Systems, 2023
Imad Jaimoukha, Deniz Gunduz, Jun-Jie Huang   +2 more
exaly  

Alternating minimization methods for strongly convex optimization

Journal of Inverse and Ill-Posed Problems, 2021
Alexander Gasnikov, Nazarii Tupitsa, Sergey Guminov   +2 more
exaly