메뉴 건너뛰기




Volumn 51, Issue 1, 2005, Pages 188-209

Designing structured tight frames via an alternating projection method

Author keywords

Algorithms; Code division multiple access (CDMA); Eigenvalues and eigenfunctions; Extremal problems; Frames; Geometry; Inverse problems; Sequences

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL GEOMETRY; EIGENVALUES AND EIGENFUNCTIONS; INVERSE PROBLEMS; MATRIX ALGEBRA; PROBLEM SOLVING;

EID: 12444320397     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.839492     Document Type: Article
Times cited : (455)

References (104)
  • 2
    • 0141938660 scopus 로고    scopus 로고
    • "Optimal CDMA signature sequences, inverse eigenvalue problems and alternating projection"
    • Yokohama, Japan, Jul
    • J. A. Tropp, R. W. Heath, and T. Strohmer, "Optimal CDMA signature sequences, inverse eigenvalue problems and alternating projection," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, Jul. 2003, p. 407.
    • (2003) Proc. 2003 IEEE Int. Symp. Information Theory , pp. 407
    • Tropp, J.A.1    Heath, R.W.2    Strohmer, T.3
  • 4
    • 84968503398 scopus 로고
    • "Proximity maps for convex sets"
    • Jun
    • E. W. Cheney and A. A. Goldstein, "Proximity maps for convex sets," Proc. Amer. Math. Soc., vol. 10, no. 3, pp. 448-450, Jun. 1959.
    • (1959) Proc. Amer. Math. Soc. , vol.10 , Issue.3 , pp. 448-450
    • Cheney, E.W.1    Goldstein, A.A.2
  • 5
    • 49949144765 scopus 로고
    • "The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming"
    • L. M. Bregman, "The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming," U.S.S.R. Comput. Math. Math. Phys., vol. 7, no. 3, pp. 200-217, 1967.
    • (1967) U.S.S.R. Comput. Math. Math. Phys. , vol.7 , Issue.3 , pp. 200-217
    • Bregman, L.M.1
  • 6
    • 0028461974 scopus 로고
    • "Optimum sequence multisets for synchronous code-division multiple-access channels"
    • Jul
    • M. Rupf and J. L. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1261-1266, Jul. 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.4 , pp. 1261-1266
    • Rupf, M.1    Massey, J.L.2
  • 7
    • 0033185351 scopus 로고    scopus 로고
    • "Optimal sequences and sum capacity of synchronous CDMA systems"
    • Sep
    • P. Viswanath and V. Anantharam, "Optimal sequences and sum capacity of synchronous CDMA systems," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 1984-1991, Sep. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.7 , pp. 1984-1991
    • Viswanath, P.1    Anantharam, V.2
  • 8
    • 0036611603 scopus 로고    scopus 로고
    • "Optimal sequences for CDMA under colored noise: A Schursaddle function property"
    • Jun
    • P. Viswanath and V. Anantharam, "Optimal sequences for CDMA under colored noise: A Schursaddle function property," IEEE Trans. Inf. Theory, vol. 48. no. 6, pp. 1295-1318, Jun. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.6 , pp. 1295-1318
    • Viswanath, P.1    Anantharam, V.2
  • 9
    • 0036477070 scopus 로고    scopus 로고
    • "Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel"
    • Feb
    • L. Zheng and D. N. C. Tse, "Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel," IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 359-383, Feb. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.2 , pp. 359-383
    • Zheng, L.1    Tse, D.N.C.2
  • 10
  • 11
    • 0036917453 scopus 로고    scopus 로고
    • "Existence and construction of noncoherent unitary space-time codes"
    • Dec
    • V. Tarokh and I.-M. Kim, "Existence and construction of noncoherent unitary space-time codes," IEEE Trans. Inf. Theory, vol. 48, pp. 3112-3117, Dec. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , pp. 3112-3117
    • Tarokh, V.1    Kim, I.-M.2
  • 12
    • 0242323185 scopus 로고    scopus 로고
    • "Grassmannian frames with applications to coding and communication"
    • Appl. Comp. Harmonic Anal., May, submitted for publication
    • T. Strohmer and R. W. Heath, "Grassmannian frames with applications to coding and communication," Appl. Comp. Harmonic Anal., vol. 14, no. 3, pp. 257-275, May 2003, submitted for publication.
    • (2003) , vol.14 , Issue.3 , pp. 257-275
    • Strohmer, T.1    Heath, R.W.2
  • 13
    • 0347968052 scopus 로고    scopus 로고
    • "Sparse representations in unions of bases"
    • Dec
    • R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.12 , pp. 3320-3325
    • Gribonval, R.1    Nielsen, M.2
  • 14
    • 5444237123 scopus 로고    scopus 로고
    • "Greed is good: Algorithmic results for sparse approximation"
    • Oct
    • J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.10 , pp. 2231-2242
    • Tropp, J.A.1
  • 16
    • 0037844320 scopus 로고    scopus 로고
    • "Meeting the Welch bound with equality"
    • London, U.K.: Springer-Verlag
    • D. V. Sarwate, "Meeting the Welch bound with equality," in Sequences and their Applications. London, U.K.: Springer-Verlag, 1998, pp. 79-102.
    • (1998) Sequences and Their Applications , pp. 79-102
    • Sarwate, D.V.1
  • 17
    • 12444280209 scopus 로고    scopus 로고
    • "Existence and construction of finite tight frames"
    • unpublished manuscript
    • P. G. Casazza and M. T. Leon, "Existence and construction of finite tight frames," unpublished manuscript, 2002.
    • (2002)
    • Casazza, P.G.1    Leon, M.T.2
  • 18
    • 8144223740 scopus 로고    scopus 로고
    • "Finite-step algorithms for constructing optimal CDMA signature sequences"
    • Nov
    • J. A. Tropp, I. S. Dhillon, and R. W. Heath, Jr., "Finite-step algorithms for constructing optimal CDMA signature sequences," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2916-2921, Nov. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.11 , pp. 2916-2921
    • Tropp, J.A.1    Dhillon, I.S.2    Heath Jr., R.W.3
  • 19
    • 0035442563 scopus 로고    scopus 로고
    • "CDMA codeword optimization: Interference avoidance and class warfare"
    • Sep
    • C. Rose, "CDMA codeword optimization: Interference avoidance and class warfare," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2368-2382, Sep. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.7 , pp. 2368-2382
    • Rose, C.1
  • 20
    • 0035395906 scopus 로고    scopus 로고
    • "Iterative construction of optimum signature sequence sets in synchronous CDMA systems"
    • Jul
    • S. Ulukus and R. D. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Trans. Inf. Theory vol. 47, no. 5, pp. 1989-1998, Jul. 2001
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.5 , pp. 1989-1998
    • Ulukus, S.1    Yates, R.D.2
  • 21
    • 0842327441 scopus 로고    scopus 로고
    • "Wireless systems and interference avoidance"
    • Jul
    • C. Rose, S. Ulukus, and R. D. Yates, "Wireless systems and interference avoidance," IEEE Trans. Wireless Commun., vol. 1. no. 3. pp. 415-428, Jul. 2002.
    • (2002) IEEE Trans. Wireless Commun. , vol.1 , Issue.3 , pp. 415-428
    • Rose, C.1    Ulukus, S.2    Yates, R.D.3
  • 22
    • 4644254528 scopus 로고    scopus 로고
    • "Iterative joint optimization of CDMA signature sequence and receiver filters"
    • Princeton, NJ, Mar
    • S. Ulukus and A. Yener, "Iterative joint optimization of CDMA signature sequence and receiver filters," in Proc. 2002 Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2002.
    • (2002) Proc. 2002 Conf. Information Sciences and Systems
    • Ulukus, S.1    Yener, A.2
  • 23
    • 0037397835 scopus 로고    scopus 로고
    • "Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum"
    • Apr
    • P. Anigstein and V. Anantharam, "Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 873-885, Apr. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.4 , pp. 873-885
    • Anigstein, P.1    Anantharam, V.2
  • 24
    • 0016060859 scopus 로고
    • "Lower bounds on the maximum cross-correlation of signals"
    • May
    • L.R. Welch, "Lower bounds on the maximum cross-correlation of signals," IEEE Trans. Inf. Theory, vol. IT-20, no. 3, pp. 397-399, May 1974.
    • (1974) IEEE Trans. Inf. Theory , vol.IT-20 , Issue.3 , pp. 397-399
    • Welch, L.R.1
  • 26
    • 10344258858 scopus 로고    scopus 로고
    • "Custom built tight frames"
    • unpublished manuscript
    • P. G. Casazza, M. Leon, and J. C. Tremain, "Custom built tight frames," unpublished manuscript, 2002.
    • (2002)
    • Casazza, P.G.1    Leon, M.2    Tremain, J.C.3
  • 28
    • 0030519411 scopus 로고    scopus 로고
    • "Packing lines, planes, etc.: Packings in Grassmannian spaces"
    • J. H. Conway, R. H. Hardin, and N. J. A. Sloane, "Packing lines, planes, etc.: Packings in Grassmannian spaces," Exper. Math., vol. 5. no. 2. pp. 139-159, 1996.
    • (1996) Exper. Math. , vol.5 , Issue.2 , pp. 139-159
    • Conway, J.H.1    Hardin, R.H.2    Sloane, N.J.A.3
  • 29
    • 0032012860 scopus 로고    scopus 로고
    • "Inverse eigenvalue problems"
    • M. T. Chu, "Inverse eigenvalue problems," SIAM Rev., vol. 40, no. 1, pp. 1-39, 1998.
    • (1998) SIAM Rev. , vol.40 , Issue.1 , pp. 1-39
    • Chu, M.T.1
  • 30
    • 85095826310 scopus 로고    scopus 로고
    • "Structured inverse eigenvalue problems"
    • M. T. Chu and G. H. Golub, "Structured inverse eigenvalue problems," Acta Numerica, vol. 11, pp. 1-71, 2001.
    • (2001) Acta Numerica , vol.11 , pp. 1-71
    • Chu, M.T.1    Golub, G.H.2
  • 31
    • 0023366336 scopus 로고
    • "The formulation and analysis of numerical methods for inverse eigenvalue problems"
    • S. Friedland, J. Nocedal, and M. L. Overton, "The formulation and analysis of numerical methods for inverse eigenvalue problems," SIAM J. Numer. Anal., pp. 634-667, 1987.
    • (1987) SIAM J. Numer. Anal. , pp. 634-667
    • Friedland, S.1    Nocedal, J.2    Overton, M.L.3
  • 32
    • 0026883934 scopus 로고
    • "Numerical methods for inverse singular value problems"
    • M. T. Chu, "Numerical methods for inverse singular value problems," SIAM J. Numer. Anal., vol. 29, pp. 885-903, 1992.
    • (1992) SIAM J. Numer. Anal. , vol.29 , pp. 885-903
    • Chu, M.T.1
  • 33
    • 11544311141 scopus 로고
    • "On the refinement of a Newton method for the inverse Toeplitz eigenvalue problem"
    • North Carolina State Univ., Raleigh, Tech. Rep
    • M. T. Chu, "On the refinement of a Newton method for the inverse Toeplitz eigenvalue problem," North Carolina State Univ., Raleigh, Tech. Rep., 1994.
    • (1994)
    • Chu, M.T.1
  • 34
    • 0025474861 scopus 로고
    • "The projected gradient method for least squares matrix approximations with spectral constraints"
    • Aug
    • M. T. Chu and K. R. Driessel, "The projected gradient method for least squares matrix approximations with spectral constraints," SIAM J. Numer. Anal., vol. 27, no. 4, pp. 1050-1060, Aug. 1990.
    • (1990) SIAM J. Numer. Anal. , vol.27 , Issue.4 , pp. 1050-1060
    • Chu, M.T.1    Driessel, K.R.2
  • 35
    • 21844491451 scopus 로고
    • "Constructing a Hermitian matrix from its diagonal entries and eigenvalues"
    • M. T. Chu, "Constructing a Hermitian matrix from its diagonal entries and eigenvalues," SIAM J. Matrix Anal. Appl., vol. 16, pp. 207-217, 1995.
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 207-217
    • Chu, M.T.1
  • 36
    • 0344153904 scopus 로고    scopus 로고
    • "Computing the nearest correlation matrix - A problem from finance"
    • N. J. Higham, "Computing the nearest correlation matrix - A problem from finance," IMA J. Numer. Anal., vol. 22, pp. 329-343, 2002.
    • (2002) IMA J. Numer. Anal. , vol.22 , pp. 329-343
    • Higham, N.J.1
  • 38
    • 0039669502 scopus 로고
    • ser. Annals of Mathematics Studies. Princeton, NJ: Princeton Univ. Press
    • J. von Neumann, Functional Operators, ser. Annals of Mathematics Studies. Princeton, NJ: Princeton Univ. Press, 1950, vol. II.
    • (1950) Functional Operators , vol.2
    • von Neumann, J.1
  • 39
    • 45949115772 scopus 로고
    • "A generalization of the Eckart-Young-Mirsky matrix approximation theorem"
    • G. H. Golub, A. Hoffman, and G. W. Stewart, "A generalization of the Eckart-Young-Mirsky matrix approximation theorem," Linear Algebra Appl., vol. 88/89, pp. 317-327, 1987.
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 317-327
    • Golub, G.H.1    Hoffman, A.2    Stewart, G.W.3
  • 40
    • 0000305146 scopus 로고
    • "Closest normal matrix finally found!"
    • A. Ruhe, "Closest normal matrix finally found!," BIT, vol. 27, pp. 585-598, 1987.
    • (1987) BIT , vol.27 , pp. 585-598
    • Ruhe, A.1
  • 41
    • 0000379660 scopus 로고
    • "Computing a nearest symmetric positive semi-definite matrix"
    • N. J. Higham, "Computing a nearest symmetric positive semi-definite matrix," Linear Algebra Appl., vol. 103, pp. 103-118, 1988.
    • (1988) Linear Algebra Appl. , vol.103 , pp. 103-118
    • Higham, N.J.1
  • 42
    • 0001930482 scopus 로고
    • "Matrix nearest problems and applications"
    • M. J. C. Gower and S. Barnett, Eds. Oxford, U.K.: Oxford Univ. Press
    • N. J. Higham, "Matrix nearest problems and applications," in Applications of Matrix Theory, M. J. C. Gower and S. Barnett, Eds. Oxford, U.K.: Oxford Univ. Press, 1989, pp. 1-27.
    • (1989) Applications of Matrix Theory , pp. 1-27
    • Higham, N.J.1
  • 44
    • 0001142618 scopus 로고
    • "The orthogonal approximation of an oblique structure in factor analysis"
    • B. F. Green, "The orthogonal approximation of an oblique structure in factor analysis," Psychometrika, vol. 17, pp. 429-440, 1952.
    • (1952) Psychometrika , vol.17 , pp. 429-440
    • Green, B.F.1
  • 45
    • 0000988974 scopus 로고
    • "A generalized solution of the orthogonal Procrustes problem"
    • P. H. Schönemann, "A generalized solution of the orthogonal Procrustes problem," Psychometrika, vol. 31, pp. 1-10, 1966.
    • (1966) Psychometrika , vol.31 , pp. 1-10
    • Schönemann, P.H.1
  • 46
    • 0001692403 scopus 로고
    • "Computing the polar decomposition - With applications"
    • N. J. Higham, "Computing the polar decomposition - With applications," SIAM J. Sci. Stat. Comput., no. 7, pp. 1160-1174, 1986.
    • (1986) SIAM J. Sci. Stat. Comput. , Issue.7 , pp. 1160-1174
    • Higham, N.J.1
  • 47
    • 0028480593 scopus 로고
    • "A parallel algorithm for computing the polar decomposition"
    • Aug
    • N. J. Higham and P. Papadimitriou, "A parallel algorithm for computing the polar decomposition," Parallel Comput., vol. 20, no. 8, pp. 1161-1173, Aug. 1994.
    • (1994) Parallel Comput. , vol.20 , Issue.8 , pp. 1161-1173
    • Higham, N.J.1    Papadimitriou, P.2
  • 49
    • 0023844714 scopus 로고
    • "Error bounds for the method of alternating projections"
    • S. Kayalar and H. Weinert, "Error bounds for the method of alternating projections," Math. Control Sig. Syst., pp. 43-59, 1988.
    • (1988) Math. Control Sig. Syst. , pp. 43-59
    • Kayalar, S.1    Weinert, H.2
  • 50
    • 0002403935 scopus 로고
    • "Block relaxation algorithms in statistics"
    • H. H. Bock, W. Lenski, and M. M. Richter, Eds. Berlin, Germany: Springer-Verlag
    • J. de Leeuw, "Block relaxation algorithms in statistics," in Information Systems and Data Analysis, H. H. Bock, W. Lenski, and M. M. Richter, Eds. Berlin, Germany: Springer-Verlag, 1994, pp. 308-325.
    • (1994) Information Systems and Data Analysis , pp. 308-325
    • de Leeuw, J.1
  • 52
    • 0037212207 scopus 로고    scopus 로고
    • "Finite normalized tight frames"
    • J. J. Benedetto and M. Fickus, "Finite normalized tight frames," Adv. Comput. Math., vol. 18, no. 2-4, pp. 357-385, 2003.
    • (2003) Adv. Comput. Math. , vol.18 , Issue.2-4 , pp. 357-385
    • Benedetto, J.J.1    Fickus, M.2
  • 53
    • 0346494937 scopus 로고    scopus 로고
    • "Equal-norm tight frames with erasures"
    • P. Casazza and J. Kovaěvić, "Equal-norm tight frames with erasures," Adv. Comput. Math., vol. 18, no. 2-4, pp. 387-430, 2003.
    • (2003) Adv. Comput. Math. , vol.18 , Issue.2-4 , pp. 387-430
    • Casazza, P.1    Kovaěvić, J.2
  • 55
    • 12444316246 scopus 로고    scopus 로고
    • "On the Existence of equiangular tight frames"
    • Univ. Texas at Austin, Dep. Comp. Sci., Tech. Rep. TR 04-32
    • M. Sustik, J. A. Tropp, I. S. Dhillon, and R. W. Heath, "On the Existence of equiangular tight frames," Univ. Texas at Austin, Dep. Comp. Sci., Tech. Rep. TR 04-32, 2004.
    • (2004)
    • Sustik, M.1    Tropp, J.A.2    Dhillon, I.S.3    Heath, R.W.4
  • 58
    • 0035443205 scopus 로고    scopus 로고
    • "Multiple-antenna signal constellations for fading channels"
    • Sep
    • D. Agrawal, T. J. Richardson, and R. L. Urbanke, "Multiple-antenna signal constellations for fading channels," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2618-2626, Sep. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.6 , pp. 2618-2626
    • Agrawal, D.1    Richardson, T.J.2    Urbanke, R.L.3
  • 59
    • 8144227433 scopus 로고    scopus 로고
    • "Topics in sparse approximation"
    • Ph.D. dissertation, Univ. Texas at Austin
    • J. A. Tropp, "Topics in sparse approximation," Ph.D. dissertation, Univ. Texas at Austin, 2004.
    • (2004)
    • Tropp, J.A.1
  • 60
    • 0034313191 scopus 로고    scopus 로고
    • "On the analysis of peak-to-average ratio (PAR) for IS95 and CDMA2000d systems"
    • Nov
    • V. K. N. Lau, "On the analysis of peak-to-average ratio (PAR) for IS95 and CDMA2000d systems," IEEE Trans. Veh. Technol., vol. 49, no. 6, pp. 2174-2188, Nov. 2000.
    • (2000) IEEE Trans. Veh. Technol. , vol.49 , Issue.6 , pp. 2174-2188
    • Lau, V.K.N.1
  • 61
    • 0004267646 scopus 로고
    • Princeton, NJ: Princeton Univ. Press
    • R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 62
    • 0003468117 scopus 로고
    • "Least squares quantization in PCM"
    • Bell Labs., Tech. Note
    • S. P. Lloyd, "Least squares quantization in PCM," Bell Labs., Tech. Note, 1957.
    • (1957)
    • Lloyd, S.P.1
  • 63
    • 0034824884 scopus 로고    scopus 로고
    • "Concept decompositions for large sparse text data using clustering"
    • I. S. Dhillon and D. S. Modha, "Concept decompositions for large sparse text data using clustering," Mach. Learning, vol. 42, no. 1, pp. 143-175, 2001.
    • (2001) Mach. Learning , vol.42 , Issue.1 , pp. 143-175
    • Dhillon, I.S.1    Modha, D.S.2
  • 64
    • 0141850419 scopus 로고    scopus 로고
    • "Diametrical clustering for identifying anti-correlated gene clusters"
    • I. S. Dhillon, E. Marcotte, and U. Roshan, "Diametrical clustering for identifying anti-correlated gene clusters," Bioinformatics, vol. 19, pp. 1612-1619, 2003.
    • (2003) Bioinformatics , vol.19 , pp. 1612-1619
    • Dhillon, I.S.1    Marcotte, E.2    Roshan, U.3
  • 66
    • 0016923670 scopus 로고
    • "Sufficient conditions for the convergence of monotonic mathematical programming algorithms"
    • R. R. Meyer, "Sufficient conditions for the convergence of monotonic mathematical programming algorithms," J. Comp. Syst. Sci., vol. 12, pp. 108-121, 1976.
    • (1976) J. Comp. Syst. Sci. , vol.12 , pp. 108-121
    • Meyer, R.R.1
  • 67
    • 0001560954 scopus 로고
    • "Information geometry and alternating minimization procedures"
    • I. Csiszár and G. Tusnády, "Information geometry and alternating minimization procedures," Statist. Decisions, vol. 1, pp. 205-237, 1984.
    • (1984) Statist. Decisions , vol.1 , pp. 205-237
    • Csiszár, I.1    Tusnády, G.2
  • 69
    • 0001683067 scopus 로고
    • "Point-to-set maps in mathematical programming"
    • Jul
    • W.W. Hogan, "Point-to-set maps in mathematical programming," SIAM Rev., vol. 15, no. 3, pp. 591-603, Jul. 1973.
    • (1973) SIAM Rev. , vol.15 , Issue.3 , pp. 591-603
    • Hogan, W.W.1
  • 70
    • 4444252999 scopus 로고
    • ser. Mathematical Programming Study, Amsterdam, The Netherlands: North-Holland
    • P. Huard, Ed., Point-to-Set Maps and Mathematical Programming. ser. Mathematical Programming Study, Amsterdam, The Netherlands: North-Holland, 1979.
    • (1979) Point-to-Set Maps and Mathematical Programming
    • Huard, P.1
  • 71
    • 0001727463 scopus 로고
    • "On the continuity of the minimum set of a continuous function"
    • G. B. Dantzig, J. Folkman, and N. Shapiro, "On the continuity of the minimum set of a continuous function," J. Math. Anal. Appl., vol. 17, pp. 519-548, 1967.
    • (1967) J. Math. Anal. Appl. , vol.17 , pp. 519-548
    • Dantzig, G.B.1    Folkman, J.2    Shapiro, N.3
  • 72
    • 84968481460 scopus 로고
    • "Weak convergence of the sequence of successive approximations for nonexpansive mappings"
    • Z. Opial, "Weak convergence of the sequence of successive approximations for nonexpansive mappings," Bull. Amer. Math. Soc. vol. 73, pp. 591-597, 1967.
    • (1967) Bull. Amer. Math. Soc. , vol.73 , pp. 591-597
    • Opial, Z.1
  • 73
    • 7044231546 scopus 로고    scopus 로고
    • "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint"
    • I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, 2004.
    • (2004) Commun. Pure Appl. Math. , vol.57 , Issue.11 , pp. 1413-1457
    • Daubechies, I.1    Defrise, M.2    Mol, C.D.3
  • 74
    • 2342630080 scopus 로고
    • "Composition and union of general algorithms of optimization"
    • ser. Mathematical Programming Studies. Amsterdam, The Netherlands: North-Holland
    • J. C. Fiorot and P. Huard, "Composition and union of general algorithms of optimization," in Point-to-Set Maps and Mathematical Programming ser. Mathematical Programming Studies. Amsterdam, The Netherlands: North-Holland, 1979, vol. 10, pp. 69-85.
    • (1979) Point-to-Set Maps and Mathematical Programming , vol.10 , pp. 69-85
    • Fiorot, J.C.1    Huard, P.2
  • 75
    • 0040464127 scopus 로고
    • "The alternating method of von Neumann"
    • W. Schempp and K. Zeller, Eds. Basel, Switzerland: Birkhäuser-Verlag
    • F. Deutsch, "The alternating method of von Neumann," in Multivariate Approximation Theory, W. Schempp and K. Zeller, Eds. Basel, Switzerland: Birkhäuser-Verlag, 1979, pp. 83-96.
    • (1979) Multivariate Approximation Theory , pp. 83-96
    • Deutsch, F.1
  • 76
    • 0001770096 scopus 로고
    • "The method of alternating orthogonal projections"
    • S. P. Singh, Ed. Amsterdam, The Netherlands: Kluwer Academic
    • F. Deutsch, "The method of alternating orthogonal projections," in Approximation Theory, Spline Functions anal Applications, S. P. Singh, Ed. Amsterdam, The Netherlands: Kluwer Academic, 1992, pp. 105-121.
    • (1992) Approximation Theory, Spline Functions Anal Applications , pp. 105-121
    • Deutsch, F.1
  • 77
    • 51249194625 scopus 로고
    • "On the factorization of matrices"
    • N. Wiener, "On the factorization of matrices," Comment. Math. Helv. vol. 29, pp. 97-111, 1955.
    • (1955) Comment. Math. Helv. , vol.29 , pp. 97-111
    • Wiener, N.1
  • 78
    • 0002477272 scopus 로고
    • "The product of projection operators"
    • I. Halperin, "The product of projection operators," Acta Sci. Math. vol. 23, pp. 96-99, 1962.
    • (1962) Acta Sci. Math. , vol.23 , pp. 96-99
    • Halperin, I.1
  • 79
    • 84966200203 scopus 로고
    • "Practical and mathematical aspects of the problem of reconstructing objects from radiographs"
    • K. T. Smith, D. C. Solmon, and S. L. Wagner, "Practical and mathematical aspects of the problem of reconstructing objects from radiographs," Bull. Amer. Math. Soc., vol. 83, pp. 1227-1270, 1977.
    • (1977) Bull. Amer. Math. Soc. , vol.83 , pp. 1227-1270
    • Smith, K.T.1    Solmon, D.C.2    Wagner, S.L.3
  • 80
    • 0036016141 scopus 로고    scopus 로고
    • "The method of alternating projections and the method of subspace corrections in Hilbert space"
    • Apr
    • J. Xu and L. Zikatonov, "The method of alternating projections and the method of subspace corrections in Hilbert space," J. Amer. Math. Soc., vol. 15, no. 3, pp. 573-597, Apr. 2002.
    • (2002) J. Amer. Math. Soc. , vol.15 , Issue.3 , pp. 573-597
    • Xu, J.1    Zikatonov, L.2
  • 81
    • 0042363723 scopus 로고    scopus 로고
    • "Accelerating the convergence of the method of alternating projections"
    • May
    • H. H. Bauschke, F. Deutsch, H. Hundal, and S.-H. Park, "Accelerating the convergence of the method of alternating projections," Trans. Amer. Math. Soc., vol. 355, no. 9, pp. 3433-3461, May 2003.
    • (2003) Trans. Amer. Math. Soc. , vol.355 , Issue.9 , pp. 3433-3461
    • Bauschke, H.H.1    Deutsch, F.2    Hundal, H.3    Park, S.-H.4
  • 82
    • 84972494519 scopus 로고
    • "On the approximation of a function of several variables by the sum of functions of fewer variables"
    • S. P. Diliberto and E. G. Straus, "On the approximation of a function of several variables by the sum of functions of fewer variables," Pacific J. Math., vol. 1, pp. 195-210, 1951.
    • (1951) Pacific J. Math. , vol.1 , pp. 195-210
    • Diliberto, S.P.1    Straus, E.G.2
  • 84
    • 3042912922 scopus 로고
    • "Approximation by functions of fewer variables"
    • R. Langer, Ed. Madison, WI: Univ. Wisconsin Press
    • M. Golomb, "Approximation by functions of fewer variables," in On Numerical Approximation, R. Langer, Ed. Madison, WI: Univ. Wisconsin Press, 1959, pp. 275-327.
    • (1959) On Numerical Approximation , pp. 275-327
    • Golomb, M.1
  • 86
    • 84948499836 scopus 로고
    • "An algorithm for restricted least squares regression"
    • R. L. Dykstra, "An algorithm for restricted least squares regression," J. Amer. Stat. Assoc., vol. 78, pp. 837-842, 1983.
    • (1983) J. Amer. Stat. Assoc. , vol.78 , pp. 837-842
    • Dykstra, R.L.1
  • 87
    • 0002436271 scopus 로고
    • "A method for finding projections onto the intersection of convex sets in Hilbert spaces"
    • ser. Lecture Notes in Statistics. Berlin, Germany: Springer-Verlag
    • J. P. Boyle and R. L. Dykstra, "A method for finding projections onto the intersection of convex sets in Hilbert spaces," in Advances in Order Restricted Inference 37, ser. Lecture Notes in Statistics. Berlin, Germany: Springer-Verlag, 1985, pp. 28-47.
    • (1985) Advances in Order Restricted Inference 37 , pp. 28-47
    • Boyle, J.P.1    Dykstra, R.L.2
  • 88
    • 0023860607 scopus 로고
    • "A successive projection method"
    • S.-P. Hall, "A successive projection method," Math. Progr., vol. 40, pp. 1-14, 1988.
    • (1988) Math. Progr. , vol.40 , pp. 1-14
    • Hall, S.-P.1
  • 89
    • 0007136851 scopus 로고
    • "A quadratic programming procedure"
    • C. Hildreth, "A quadratic programming procedure," Naval Res. Logist. Quart., vol. 4, pp. 79-85, 1957.
    • (1957) Naval Res. Logist. Quart. , vol.4 , pp. 79-85
    • Hildreth, C.1
  • 91
    • 22844453400 scopus 로고    scopus 로고
    • "Dykstra's algorithm as the nonlinear extension of Bregman's optimization method"
    • L. M. Bregman, Y. Censor, and S. Reich, "Dykstra's algorithm as the nonlinear extension of Bregman's optimization method," J. Convex Anal., vol. 6, no. 2, pp. 319-333, 1999.
    • (1999) J. Convex Anal. , vol.6 , Issue.2 , pp. 319-333
    • Bregman, L.M.1    Censor, Y.2    Reich, S.3
  • 92
    • 0027576766 scopus 로고
    • "Dual coordinate ascent methods for nonstrictly convex mimmization"
    • P. Tseng, "Dual coordinate ascent methods for nonstrictly convex mimmization," Math. Progr., vol. 59, pp. 231-247, 1993.
    • (1993) Math. Progr. , vol.59 , pp. 231-247
    • Tseng, P.1
  • 93
    • 0030246542 scopus 로고    scopus 로고
    • "On projection algorithms for solving convex feasibility problems"
    • H. H. Bauschke and J. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, 1996.
    • (1996) SIAM Rev. , vol.38 , Issue.3 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.2
  • 94
    • 0025535641 scopus 로고
    • "Method of successive projections for finding a common point of sets in metric spaces"
    • P. L. Combettes and H. J. Trussell, "Method of successive projections for finding a common point of sets in metric spaces," J. Optim. Theory Applic., vol. 67, no. 3, pp. 487-507, 1990.
    • (1990) J. Optim. Theory Applic. , vol.67 , Issue.3 , pp. 487-507
    • Combettes, P.L.1    Trussell, H.J.2
  • 95
    • 0023827797 scopus 로고
    • "Signal enhancement A composite property mapping algorithm"
    • Jan
    • J. A. Cadzow, "Signal enhancement A composite property mapping algorithm," IEEE Trans. Acoust., Speech, Signal Process., vol. 36. no. 1. pp. 49-62, Jan. 1988.
    • (1988) IEEE Trans. Acoust., Speech, Signal Process. , vol.36 , Issue.1 , pp. 49-62
    • Cadzow, J.A.1
  • 96
    • 0015376113 scopus 로고
    • "Computation of channel capacity and rate distortion functions"
    • Jul
    • R. Blahut, "Computation of channel capacity and rate distortion functions," IEEE Trans. Inf. Theory, vol. IT- 18, no. 4, pp. 460-473, Jul. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.IT-18 , Issue.4 , pp. 460-473
    • Blahut, R.1
  • 97
    • 0015287895 scopus 로고
    • "An algorithm for calculating the capacity of an arbitrary discrete memoryless channel"
    • Jan
    • S. Arimoto, "An algorithm for calculating the capacity of an arbitrary discrete memoryless channel," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 14-20, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.IT-18 , Issue.1 , pp. 14-20
    • Arimoto, S.1
  • 98
    • 0003310193 scopus 로고
    • "The recovery of distorted band-limited signals"
    • H. J. Landau and W. L. Miranker, "The recovery of distorted band-limited signals," J. Math Anal. Appl., vol. 2. pp. 97-104, 1961.
    • (1961) J. Math Anal. Appl. , vol.2 , pp. 97-104
    • Landau, H.J.1    Miranker, W.L.2
  • 99
    • 84949069862 scopus 로고
    • "Super-resolution through error energy reduction"
    • R. W. Gerchberg, "Super-resolution through error energy reduction," Opt. Acta, vol. 21, pp. 709-720, 1974.
    • (1974) Opt. Acta , vol.21 , pp. 709-720
    • Gerchberg, R.W.1
  • 100
    • 0020191832 scopus 로고
    • "Image restoration by the method of convex projections. I - Theory"
    • Mar
    • D. C. Youla and H. Webb, "Image restoration by the method of convex projections. I - Theory," IEEE Trans. Med. Imag., vol. ME-l, pp. 81-94, Mar. 1982.
    • (1982) IEEE Trans. Med. Imag. , vol.ME-1 , pp. 81-94
    • Youla, D.C.1    Webb, H.2
  • 101
    • 0001616908 scopus 로고
    • "Uncertainty principles and signal recovery"
    • Jun
    • D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, Jun. 1989.
    • (1989) SIAM J. Appl. Math. , vol.49 , Issue.3 , pp. 906-931
    • Donoho, D.L.1    Stark, P.B.2
  • 102
    • 0031099236 scopus 로고    scopus 로고
    • "Equiripple FIR filter design by the FFT algorithm"
    • Mar
    • A. E. Çetin, Ö. N. Gerek, and Y. Yardimci, "Equiripple FIR filter design by the FFT algorithm," IEEE Sig. Process. Mag., vol. 14, no. 2, pp. 40-64, Mar. 1997.
    • (1997) IEEE Sig. Process. Mag. , vol.14 , Issue.2 , pp. 40-64
    • Çetin, A.E.1    Gerek, Ö.N.2    Yardimci, Y.3
  • 103
    • 0032237879 scopus 로고    scopus 로고
    • "The nearest 'doubly stochastic' matrix to a real matrix with the same first moment"
    • Dec
    • W. Glunt and T. L. Hayden, "The nearest 'doubly stochastic' matrix to a real matrix with the same first moment," Numer. Linear Algebra Appl. vol. 5, no. 6, Dec. 1998.
    • (1998) Numer. Linear Algebra Appl. , vol.5 , Issue.6
    • Glunt, W.1    Hayden, T.L.2
  • 104
    • 0002629270 scopus 로고
    • "Maximum likelihood from incomplete data via the EM algorithm"
    • A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Stat. Soc., vol. 39, pp. 1-38, 1977.
    • (1977) J. Roy. Stat. Soc. , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.