메뉴 건너뛰기




Volumn 134, Issue 1, 2012, Pages 223-257

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization

Author keywords

Compressed sensing; Derivative free optimization; Interpolation based trust region methods; L1 Minimization; Random sampling; Sparse recovery

Indexed keywords

COMPRESSIVE SENSING; DERIVATIVE-FREE OPTIMIZATION; RANDOM SAMPLING; SPARSE RECOVERY; TRUST-REGION METHODS;

EID: 84865690792     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0578-z     Document Type: Conference Paper
Times cited : (62)

References (31)
  • 1
    • 2342458706 scopus 로고    scopus 로고
    • Second-order cone programming
    • Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3-51 (2003)
    • (2003) Math. Program. , vol.95 , pp. 3-51
    • Alizadeh, F.1    Goldfarb, D.2
  • 4
    • 55649115527 scopus 로고    scopus 로고
    • Asimple proof of the restricted isometry property for random matrices
    • Baraniuk, R.,Davenport, M.,DeVore, R.,Wakin,M.:Asimple proof of the restricted isometry property for random matrices. Constr. Approx. 28, 253-263 (2008)
    • (2008) Constr. Approx. , vol.28 , pp. 253-263
    • Baraniuk, R.1    Davenport, M.2    DeVore, R.3    Wakin, M.4
  • 5
    • 33947416035 scopus 로고    scopus 로고
    • Near optimal signal recovery from random projections: Universal encoding strategies?
    • Candès, E., Tao, T.: Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. Theory 52, 5406-5425 (2006)
    • (2006) IEEE Trans. Inf. Theory , vol.52 , pp. 5406-5425
    • Candès, E.1    Tao, T.2
  • 6
    • 42649140570 scopus 로고    scopus 로고
    • The restricted isometry property and its implications for compressed sensing
    • Paris, Serie I
    • Candès, E.J.: The restricted isometry property and its implications for compressed sensing. Compte Rendus de l'Academie des Sciences, Paris, Serie I, pp. 589-592 (2009)
    • (2009) Compte Rendus de l'Academie des Sciences , pp. 589-592
    • Candès, E.J.1
  • 7
    • 27744469963 scopus 로고    scopus 로고
    • Optimizing partially separable functions without derivatives Optim
    • Colson, B., Toint, Ph. L.: Optimizing partially separable functions without derivatives Optim.Methods Softw. 20, 493-508 (2005)
    • (2005) Methods Softw , vol.20 , pp. 493-508
    • Colson, B.1    Toint, Ph.L.2
  • 10
    • 70450200040 scopus 로고    scopus 로고
    • Global convergence of general derivative-free trust-region algorithms to first and second order critical points
    • Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first and second order critical points SIAM J. Optim. 20, 387-415 (2009)
    • (2009) SIAM J. Optim. , vol.20 , pp. 387-415
    • Conn, A.R.1    Scheinberg, K.2    Vicente, L.N.3
  • 12
    • 28244496090 scopus 로고    scopus 로고
    • Benchmarking optimization software with performance profiles
    • Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles Math. Program. 91, 201-213 (2002)
    • (2002) Math. Program. , vol.91 , pp. 201-213
    • Dolan, E.D.1    Moré, J.J.2
  • 13
    • 33747180773 scopus 로고    scopus 로고
    • Optimality measures for performance profiles
    • Dolan, E.D., Moré, J.J., Munson, T.S.: Optimality measures for performance profiles SIAM J. Optim. 16, 891-909 (2006)
    • (2006) SIAM J. Optim. , vol.16 , pp. 891-909
    • Dolan, E.D.1    Moré, J.J.2    Munson, T.S.3
  • 14
    • 57649221286 scopus 로고    scopus 로고
    • On the geometry phase in model-based algorithms for derivative-free optimization Optim
    • Fasano, G., Morales, J.L., Nocedal, J.: On the geometry phase in model-based algorithms for derivative-free optimization Optim. Methods Softw. 24, 145-154 (2009)
    • (2009) Methods Softw , vol.24 , pp. 145-154
    • Fasano, G.1    Morales, J.L.2    Nocedal, J.3
  • 16
    • 2442598318 scopus 로고    scopus 로고
    • CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited
    • Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited ACM Trans. Math. Softw. 29, 373-394 (2003)
    • (2003) ACM Trans. Math. Softw. , vol.29 , pp. 373-394
    • Gould, N.I.M.1    Orban, D.2    Toint, Ph.L.3
  • 17
    • 80053291926 scopus 로고    scopus 로고
    • An active-set trust-region method for derivative-free nonlinear bound-constrained optimization Optim
    • Gratton, S., Toint, Ph.L., Tröltzsch, A.: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization Optim. Methods Softw. 26, 873-894 (2011)
    • (2011) Methods Softw , vol.26 , pp. 873-894
    • Gratton, S.1    Toint, Ph.L.2    Troltzsch, A.3
  • 18
    • 77955423413 scopus 로고    scopus 로고
    • Ashort note on compressed sensing with partially known signal support
    • Jacques, L.:Ashort note on compressed sensing with partially known signal support Signal Process. 90, 3308-3312 (2010)
    • (2010) Signal Process , vol.90 , pp. 3308-3312
    • Jacques, L.1
  • 21
    • 3042652542 scopus 로고    scopus 로고
    • On trust region methods for unconstrained minimization without derivatives
    • Powell, M.J.D.: On trust region methods for unconstrained minimization without derivatives Math. Program. 97, 605-623 (2003)
    • (2003) Math. Program. , vol.97 , pp. 605-623
    • Powell, M.J.D.1
  • 22
    • 21044444302 scopus 로고    scopus 로고
    • Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
    • Powell, M.J.D.: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions Math. Program. 100, 183-215 (2004)
    • (2004) Math. Program. , vol.100 , pp. 183-215
    • Powell, M.J.D.1
  • 23
    • 33846538819 scopus 로고    scopus 로고
    • The NEWUOA software for unconstrained optimization without derivatives
    • Springer, Berlin
    • Powell, M.J.D.: The NEWUOA software for unconstrained optimization without derivatives. In: Nonconvex Optim. Appl., vol. 83, pp. 255-297. Springer, Berlin (2006)
    • (2006) Nonconvex Optim. Appl. , vol.83 , pp. 255-297
    • Powell, M.J.D.1
  • 24
    • 78349246612 scopus 로고    scopus 로고
    • Compressive sensing and structured random matrices
    • In: Fornasier, M. (ed.) Radon Series Comp. Appl.Math.
    • Rauhut, H.: Compressive sensing and structured random matrices. In: Fornasier, M. (ed.) Theoretical Foundations and Numerical Methods for Sparse Recovery, Radon Series Comp. Appl.Math., pp. 1-92 (2010)
    • (2010) Theoretical Foundations and Numerical Methods for Sparse Recovery , pp. 1-92
    • Rauhut, H.1
  • 25
    • 84858165576 scopus 로고    scopus 로고
    • Sparse Legendre expansions via -1-minimization
    • Rauhut, H., Ward, R.: Sparse Legendre expansions via -1-minimization. J. Approx. Theory 164, 517-533 (2012)
    • (2012) J. Approx. Theory , vol.164 , pp. 517-533
    • Rauhut, H.1    Ward, R.2
  • 26
    • 79251516126 scopus 로고    scopus 로고
    • Self-correcting geometry in model-based algorithms for derivative-free unconstrained optimization
    • Scheinberg, K., Toint, P.L.: Self-correcting geometry in model-based algorithms for derivative-free unconstrained optimization SIAM J. Optim. 20, 3512-3532 (2010)
    • (2010) SIAM J. Optim. , vol.20 , pp. 3512-3532
    • Scheinberg, K.1    Toint, P.L.2
  • 28
    • 77954588549 scopus 로고    scopus 로고
    • Modified-CS: Modifying compressive sensing for problems with partially known support
    • Vaswani, N., Lu,W.: Modified-CS: Modifying compressive sensing for problems with partially known support IEEE Trans. Signal Process. 58, 4595-4607 (2010)
    • (2010) IEEE Trans. Signal Process. , vol.58 , pp. 4595-4607
    • Vaswani, N.1    Lu, W.2
  • 30
    • 75849163827 scopus 로고    scopus 로고
    • Stability and instance optimality for gaussian measurements in compressed sensing Found
    • Wojtaszczyk, P.: Stability and instance optimality for gaussian measurements in compressed sensing Found. Comput. Math. 10, 1-13 (2010)
    • (2010) Comput. Math. , vol.10 , pp. 1-13
    • Wojtaszczyk, P.1
  • 31
    • 0032303559 scopus 로고    scopus 로고
    • Solving large-scale linear programs by interior-oint methods under the MATLAB environment Optim
    • Zhang, Y.: Solving large-scale linear programs by interior-oint methods under the MATLAB environment Optim. Methods Softw. 10, 1-31 (1998)
    • (1998) Methods Softw , vol.10 , pp. 1-31
    • Zhang, Y.1


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