메뉴 건너뛰기




Volumn 104, Issue 2-3, 2005, Pages 583-608

A VU-algorithm for convex minimization

Author keywords

Bundle methods; Convex Minimization; Proximal Points; Superlinear convergence; VU decomposition

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; THEOREM PROVING;

EID: 27244442224     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0630-3     Document Type: Article
Times cited : (93)

References (41)
  • 1
    • 0020702681 scopus 로고
    • Numerical methods for nondifferentiable convex optimization
    • Auslender, A.: Numerical methods for nondifferentiable convex optimization. Math. Programming Stud. 30, 102-126 (1987)
    • (1987) Math. Programming Stud. , vol.30 , pp. 102-126
    • Auslender, A.1
  • 3
    • 0028319529 scopus 로고
    • Representations of quasi-Newton matrices and their use in limited-memory methods
    • Byrd, R., Nocedal, J., Schnabel, R.: Representations of quasi-Newton matrices and their use in limited-memory methods. Math. Program. 63, 129-156 (1994)
    • (1994) Math. Program. , vol.63 , pp. 129-156
    • Byrd, R.1    Nocedal, J.2    Schnabel, R.3
  • 4
    • 0001106044 scopus 로고    scopus 로고
    • Proximal quasi-Newton methods for nondifferentiable convex optimization
    • Ser. A
    • Chen, X., Fukushima, M.: Proximal quasi-Newton methods for nondifferentiable convex optimization. Math. Program. 85 (2, Ser. A), 313-334 (1999)
    • (1999) Math. Program. , vol.85 , Issue.2 , pp. 313-334
    • Chen, X.1    Fukushima, M.2
  • 5
    • 0000882113 scopus 로고
    • Newton's method for convex programming and Tchebycheff approximations
    • Cheney, E., Goldstein, A.: Newton's method for convex programming and Tchebycheff approximations. Numerische Mathematik 1, 253-268 (1959)
    • (1959) Numerische Mathematik , vol.1 , pp. 253-268
    • Cheney, E.1    Goldstein, A.2
  • 6
    • 33646971357 scopus 로고
    • Convergence of some algorithms for convex minimization
    • Correa, R., Lemaréchal, C.: Convergence of some algorithms for convex minimization. Math. Program. 62 (2), 261-275 (1993)
    • (1993) Math. Program. , vol.62 , Issue.2 , pp. 261-275
    • Correa, R.1    Lemaréchal, C.2
  • 7
    • 0021503955 scopus 로고
    • A descent algorithm for nonsmooth convex optimization
    • Fukushima, M.: A descent algorithm for nonsmooth convex optimization. Math. Program. 30, 163-175 (1984)
    • (1984) Math. Program. , vol.30 , pp. 163-175
    • Fukushima, M.1
  • 8
    • 0030508716 scopus 로고    scopus 로고
    • A globally and superlinearly convergent algorithm for nonsmooth convex minimization
    • Fukushima, M., Qi, L.: A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J. Optimization 6, 1106-1120 (1996)
    • (1996) SIAM J. Optimization , vol.6 , pp. 1106-1120
    • Fukushima, M.1    Qi, L.2
  • 9
    • 34249975203 scopus 로고
    • Some numerical experiments with variable-storage quasi-Newton algorithms
    • Gilbert, J., Lemaréchal, C.: Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45, 407-435 (1989)
    • (1989) Math. Program. , vol.45 , pp. 407-435
    • Gilbert, J.1    Lemaréchal, C.2
  • 10
    • 6344259312 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Mathematics, Simon Fraser University. Preprint available at
    • Hare, W.: Nonsmooth Optimization with Smooth Substructure. Ph.D. thesis, Department of Mathematics, Simon Fraser University (2003). Preprint available at http://www.cecm.sfu.ca/~whare
    • (2003) Nonsmooth Optimization with Smooth Substructure
    • Hare, W.1
  • 12
    • 0001547779 scopus 로고
    • The cutting plane method for solving convex programs
    • Kelley, J.E.: The cutting plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8, 703-712 (1960)
    • (1960) J. Soc. Indust. Appl. Math. , vol.8 , pp. 703-712
    • Kelley, J.E.1
  • 13
    • 0020912156 scopus 로고
    • An aggregate subgradient method for nonsmooth convex minimization
    • Kiwiel, K.: An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27, 320-341 (1983)
    • (1983) Math. Program. , vol.27 , pp. 320-341
    • Kiwiel, K.1
  • 14
    • 0001260166 scopus 로고
    • A method for solving certain quadratic programming problems arising in nonsmooth optimization
    • Kiwiel, K.: A method for solving certain quadratic programming problems arising in nonsmooth optimization. IMA Journal of Numerical Analysis 6, 137-152 (1986)
    • (1986) IMA Journal of Numerical Analysis , vol.6 , pp. 137-152
    • Kiwiel, K.1
  • 15
    • 0032333546 scopus 로고    scopus 로고
    • BFGS with update skipping and varying memory
    • Kolda, T., O'Leary, D., Nazareth, J.: BFGS with update skipping and varying memory. SIAM J. Optimization 8, 1060-1083 (1998)
    • (1998) SIAM J. Optimization , vol.8 , pp. 1060-1083
    • Kolda, T.1    O'Leary, D.2    Nazareth, J.3
  • 16
    • 0020301983 scopus 로고
    • Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
    • Lemaréchal, C., Mifflin, R.: Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. Math. Program. 24, 241-256 (1982)
    • (1982) Math. Program. , vol.24 , pp. 241-256
    • Lemaréchal, C.1    Mifflin, R.2
  • 17
    • 18144452970 scopus 로고    scopus 로고
    • Growth conditions and Μ-Lagrangians
    • Lemaréchal, C., Oustry, F.: Growth conditions and Μ-Lagrangians. Set-Valued Analysis 9 (1/2), 123-129 (2001)
    • (2001) Set-valued Analysis , vol.9 , Issue.1-2 , pp. 123-129
    • Lemaréchal, C.1    Oustry, F.2
  • 19
    • 0000525522 scopus 로고
    • An approach to variable metric bundle methods
    • J. Henry, J.P. Yvon, (eds.), Systems Modeling and Optimization, Springer-Verlag
    • Lemaréchal, C., Sagastizábal, C.: An approach to variable metric bundle methods. In: J. Henry, J.P. Yvon, (eds.), Systems Modeling and Optimization, no. 197 in Lecture Notes in Control and Information Sciences, Springer-Verlag, 1994, pp. 144-162
    • (1994) Lecture Notes in Control and Information Sciences , vol.197 , pp. 144-162
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 20
    • 21744439259 scopus 로고    scopus 로고
    • More than first-order developments of convex functions: Primal-dual relations
    • Lemaréchal, C., Sagastizábal, C.: More than first-order developments of convex functions: primal-dual relations. J. Convex Analysis 3 (2), 1-14 (1996)
    • (1996) J. Convex Analysis , vol.3 , Issue.2 , pp. 1-14
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 21
    • 0040165092 scopus 로고    scopus 로고
    • Practical aspects of the Moreau-Yosida regularization: Theoretical preliminaries
    • Lemaréchal, C., Sagastizábal, C.: Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM J. Optimization 7 (2), 367-385 (1997)
    • (1997) SIAM J. Optimization , vol.7 , Issue.2 , pp. 367-385
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 22
    • 0000275440 scopus 로고    scopus 로고
    • Variable metric bundle methods: From conceptual to implementable forms
    • Lemaréchal, C., Sagastizábal, C.: Variable metric bundle methods: from conceptual to implementable forms. Math. Program., Ser. A 76, 393-410 (1997)
    • (1997) Math. Program., Ser. A , vol.76 , pp. 393-410
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 23
    • 33646887390 scopus 로고
    • On the limited memory BFGS method for large scale optimization
    • Liu, D., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503-520 (1989)
    • (1989) Math. Program. , vol.45 , pp. 503-520
    • Liu, D.1    Nocedal, J.2
  • 25
    • 17044426318 scopus 로고
    • On superlinear convergence in univariate nonsmooth minimization
    • Mifflin, R.: On superlinear convergence in univariate nonsmooth minimization. Math. Program. 49, 273-279 (1991)
    • (1991) Math. Program. , vol.49 , pp. 273-279
    • Mifflin, R.1
  • 26
    • 0001844687 scopus 로고    scopus 로고
    • A quasi-second-order proximal bundle algorithm
    • Mifflin, R.: A quasi-second-order proximal bundle algorithm. Math. Program. 73 (1), 51-72 (1996)
    • (1996) Math. Program. , vol.73 , Issue.1 , pp. 51-72
    • Mifflin, R.1
  • 27
    • 0001487375 scopus 로고    scopus 로고
    • VΜ-decomposition derivatives for convex max-functions
    • R. Tichatschke, M. Théra (eds.), Ill-posed Variational Problems and Regularization Techniques, Springer-Verlag Berlin Heidelberg
    • Mifflin, R., Sagastizábal, C.: vΜ-decomposition derivatives for convex max-functions. In: R. Tichatschke, M. Théra (eds.), Ill-posed Variational Problems and Regularization Techniques, no. 477 in Lecture Notes in Economics and Mathematical Systems, Springer-Verlag Berlin Heidelberg, 1999, pp. 167-186
    • (1999) Lecture Notes in Economics and Mathematical Systems , vol.477 , pp. 167-186
    • Mifflin, R.1    Sagastizábal, C.2
  • 28
    • 0002963707 scopus 로고    scopus 로고
    • Functions with primal-dual gradient structure and Μ-Hessians
    • G.D. Pillo, F. Giannessi, (eds.), Nonlinear Optimization and Related Topics, Kluwer Academic Publishers B.V.
    • Mifflin, R., Sagastizábal, C.: Functions with primal-dual gradient structure and Μ-Hessians. In: G.D. Pillo, F. Giannessi, (eds.), Nonlinear Optimization and Related Topics, no. 36 in Applied Optimization, Kluwer Academic Publishers B.V. 2000, pp. 219-233
    • (2000) Applied Optimization , vol.36 , pp. 219-233
    • Mifflin, R.1    Sagastizábal, C.2
  • 29
    • 0034353743 scopus 로고    scopus 로고
    • On vΜ-theory for functions with primal-dual gradient structure
    • Mifflin, R., Sagastizábal, C.: On vΜ-theory for functions with primal-dual gradient structure. SIAM J. Optimization 11 (2), 547-571 (2000)
    • (2000) SIAM J. Optimization , vol.11 , Issue.2 , pp. 547-571
    • Mifflin, R.1    Sagastizábal, C.2
  • 31
    • 0242679716 scopus 로고    scopus 로고
    • Primal-dual Gradient Structured Functions: Second-order results; links to epi-derivatives and partly smooth functions
    • Mifflin, R., Sagastizábal, C.: Primal-Dual Gradient Structured Functions: second-order results; links to epi-derivatives and partly smooth functions. SIAM Journal on Optimization 13 (4), 1174-1194 (2003)
    • (2003) SIAM Journal on Optimization , vol.13 , Issue.4 , pp. 1174-1194
    • Mifflin, R.1    Sagastizábal, C.2
  • 32
    • 6344221585 scopus 로고    scopus 로고
    • VΜ-smoothness and proximal point results for some nonconvex functions
    • Mifflin, R., Sagastizábal, C.: vΜ-Smoothness and Proximal Point Results for Some Nonconvex Functions. Optimization Methods and Software 19 (5), 463-478 (2004)
    • (2004) Optimization Methods and Software , vol.19 , Issue.5 , pp. 463-478
    • Mifflin, R.1    Sagastizábal, C.2
  • 33
    • 17044404648 scopus 로고    scopus 로고
    • Relating Μ-Lagrangians to second order epiderivatives and proximal tracks
    • Mifflin, R., Sagastizábal, C.: Relating Μ-Lagrangians to Second Order Epiderivatives and Proximal Tracks. Journal of Convex Analysis 12 (1), 81-93 (2005). Http://www.heldermann.de/JCA/JCA12/jca12.htm
    • (2005) Journal of Convex Analysis , vol.12 , Issue.1 , pp. 81-93
    • Mifflin, R.1    Sagastizábal, C.2
  • 34
    • 0032222087 scopus 로고    scopus 로고
    • Quasi-Newton bundle-type methods for nondifferentiable convex optimization
    • Mifflin, R., Sun, D., Qi, L.: Quasi-Newton bundle-type methods for nondifferentiable convex optimization. SIAM Journal on Optimization 8 (2), 583-603 (1998)
    • (1998) SIAM Journal on Optimization , vol.8 , Issue.2 , pp. 583-603
    • Mifflin, R.1    Sun, D.2    Qi, L.3
  • 35
    • 27244458561 scopus 로고    scopus 로고
    • Connections among Μ-Lagrangian, Riemannian Newton, and SQP methods
    • INRIA
    • Miller, S.A., Malick, J.: Connections among Μ-Lagrangian, Riemannian Newton, and SQP Methods. Rapport de Recherche 5185, INRIA (2004)
    • (2004) Rapport de Recherche , vol.5185
    • Miller, S.A.1    Malick, J.2
  • 37
    • 0002928322 scopus 로고    scopus 로고
    • A second-order bundle method to minimize the maximum eigenvalue function
    • Ser. A
    • Oustry, F.: A second-order bundle method to minimize the maximum eigenvalue function. Math. Program. 89 (1, Ser. A), 1-33 (2000)
    • (2000) Math. Program. , vol.89 , Issue.1 , pp. 1-33
    • Oustry, F.1
  • 38
    • 0001517804 scopus 로고    scopus 로고
    • A preconditioning proximal Newton method for nondifferentiable convex optimization
    • Ser. B
    • Qi, L., Chen, X.: A preconditioning proximal Newton method for nondifferentiable convex optimization. Math. Program. 76 (3, Ser. B), 411-429 (1997)
    • (1997) Math. Program. , vol.76 , Issue.3 , pp. 411-429
    • Qi, L.1    Chen, X.2
  • 39
    • 0034348369 scopus 로고    scopus 로고
    • Globally convergent BFGS method for nonsmooth convex optimization
    • Rauf, A., Fukushima, M.: Globally convergent BFGS method for nonsmooth convex optimization. J. Optim. Theory Appl. 104 (3), 539-558 (2000)
    • (2000) J. Optim. Theory Appl. , vol.104 , Issue.3 , pp. 539-558
    • Rauf, A.1    Fukushima, M.2
  • 40


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