scholarly journals KKT Proximity Measure Versus Augmented Achievement Scalarization Function

2018 ◽  
Vol 182 (24) ◽  
pp. 1-7
Author(s):  
Mohamed Abouhawwash ◽  
M. A.
Keyword(s):  
Proximity Measure ◽  
Measure Versus ◽  
Scalarization Function

scholarly journals Changes in Occupational Tasks and Their Association with Individual Wages and Occupational Mobility

2019 ◽  
Vol 20 (4) ◽  
pp. e295-e328
Author(s):  
Alexandra Fedorets
Keyword(s):  
Large Scale ◽  
Occupational Mobility ◽  
Wage Growth ◽  
Panel Survey ◽  
Proximity Measure ◽  
Wage Dynamics ◽  
Cross Sectional ◽  
Individual Level ◽  
Occupational Tasks ◽  
Over Time

Abstract This study provides novel evidence on the relevance of task content changes between and within occupations to wage dynamics of occupational changers and stayers. I use individual-level, cross-sectional data featuring tasks performed on the job to compute a measure of proximity of job contents. Then, I merge this measure to a large-scale panel survey to show that occupational changers experience a wage growth that is declining when the accompanying alterations in task contents are big. For occupational stayers, alterations in task contents generate a positive wage component, beyond tenure effect. However, the results are not robust with respect to the choice of proximity measure and over time.

A corrector–predictor path-following algorithm for semidefinite optimization

2014 ◽  
Vol 07 (02) ◽  
pp. 1450028 ◽  
Author(s):  
Behrouz Kheirfam
Keyword(s):  
Line Search ◽  
Optimization Problems ◽  
Path Following ◽  
Central Path ◽  
Semidefinite Optimization ◽  
Iteration Complexity ◽  
Proximity Measure ◽  
Corrector Step ◽  
Predictor Step ◽  
Path Following Algorithm

A corrector–predictor algorithm is proposed for solving semidefinite optimization problems. In each two steps, the algorithm uses the Nesterov–Todd directions. The algorithm produces a sequence of iterates in a neighborhood of the central path based on a new proximity measure. The predictor step uses line search schemes requiring the reduction of the duality gap, while the corrector step is used to restore the iterates to the neighborhood of the central path. Finally, the algorithm has [Formula: see text] iteration complexity.

Analysis of variance procedures based on a proximity measure between subjects.

1982 ◽  
Vol 91 (2) ◽  
pp. 424-430 ◽  
Author(s):  
Lawrence J. Hubert ◽  
Reginald G. Golledge ◽  
C. M. Costanzo
Keyword(s):  
Analysis Of Variance ◽  
Proximity Measure
Sign in / Sign up

Export Citation Format

Share Document