Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach

SIAM Journal on Control and Optimization ◽

10.1137/0328011 ◽

1990 ◽

Vol 28 (1) ◽

pp. 214-242 ◽

Author(s):

Paul Tseng

Keyword(s):

Linear Constraints ◽

Unified Approach ◽

Strictly Convex ◽

Dual Ascent ◽

Download Full-text

Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Mathematics of Operations Research ◽

10.1287/moor.22.2.326 ◽

1997 ◽

Vol 22 (2) ◽

pp. 326-349 ◽

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Linear Constraints ◽

Relaxation Methods ◽

Strictly Convex ◽

Download Full-text

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Mathematics of Operations Research ◽

10.1287/moor.16.3.462 ◽

1991 ◽

Vol 16 (3) ◽

pp. 462-481 ◽

Author(s):

Paul Tseng ◽

Dimitri P. Bertsekas

Keyword(s):

Linear Constraints ◽

Relaxation Methods ◽

Strictly Convex ◽

Download Full-text

Constructing optimal maps for Monge’s transport problem as a limit of strictly convex costs

Journal of the American Mathematical Society ◽

10.1090/s0894-0347-01-00376-9 ◽

2001 ◽

Vol 15 (1) ◽

pp. 1-26 ◽

Author(s):

Luis A. Caffarelli ◽

Mikhail Feldman ◽

Robert J. McCann

Keyword(s):

Transport Problem ◽

Strictly Convex ◽

Download Full-text

INTEGER PRICING AND BERTRAND-EDGEWORTH OLIGOPOLY WITH STRICTLY CONVEX COSTS: IS IT WORTH MORE THAN A PENNY?

Bulletin of Economic Research ◽

10.1111/j.1467-8586.1993.tb00570.x ◽

1993 ◽

Vol 45 (3) ◽

pp. 257-268 ◽

Author(s):

Huw David Dixon

Keyword(s):

Strictly Convex ◽

Download Full-text

Relaxation methods for problems with strictly convex separable costs and linear constraints

Mathematical Programming ◽

10.1007/bf02592017 ◽

1987 ◽

Vol 38 (3) ◽

pp. 303-321 ◽

Author(s):

Paul Tseng ◽

Dimitri P. Bertsekas

Keyword(s):

Linear Constraints ◽

Relaxation Methods ◽

Strictly Convex

Download Full-text

A unified approach to the feasible direction methods for nonlinear programming with linear constraints

Acta Mathematicae Applicatae Sinica English Series ◽

10.1007/bf01883894 ◽

1984 ◽

Vol 1 (1) ◽

pp. 63-75 ◽

Author(s):

Yue Minyi ◽

Han Jiye

Keyword(s):

Nonlinear Programming ◽

Linear Constraints ◽

Unified Approach ◽

Feasible Direction ◽

Feasible Direction Methods

Download Full-text

A unified approach to statistical image reconstruction using dual ascent optimization

IEEE Symposium Conference Record Nuclear Science 2004. ◽

10.1109/nssmic.2004.1466650 ◽

2005 ◽

Author(s):

Meihua Li ◽

H. Kudo

Keyword(s):

Image Reconstruction ◽

Unified Approach ◽

Dual Ascent ◽

Statistical Image Reconstruction

Download Full-text

A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties

Annals of Operations Research ◽

10.1007/bf02216819 ◽

1990 ◽

Vol 24 (1) ◽

pp. 113-144

Author(s):

Jiye Han ◽

Xiaodong Hu ◽

Jin Liu

Keyword(s):

Nonlinear Programming ◽

Linear Constraints ◽

Point Method ◽

Feasible Point ◽

Convergence Properties ◽

Unified Approach ◽

Feasible Point Method

Download Full-text

A unified approach to the design of linear constraints in minimum variance adaptive beamformers

IEEE Transactions on Antennas and Propagation ◽

10.1109/8.204744 ◽

1992 ◽

Vol 40 (12) ◽

pp. 1533-1542 ◽

Author(s):

C.-Y. Tseng ◽

L.J. Griffiths

Keyword(s):

Minimum Variance ◽

Linear Constraints ◽

Unified Approach

Download Full-text

A Unified Approach to Study the Thermal Dynamics in Multilongitudinal Mode Semiconductor Lasers

Fiber & Integrated Optics ◽

10.1080/01468030151076107 ◽

2001 ◽

Vol 20 (2) ◽

pp. 159-169 ◽

Author(s):

M. Ganesh Madhan ◽

P. R. Vaya ◽

N. Gunasekaran

Keyword(s):

Semiconductor Lasers ◽

Unified Approach ◽

Thermal Dynamics

Download Full-text