메뉴 건너뛰기




Volumn 21, Issue 4, 2003, Pages 451-462

Proximal point algorithm for minimization of DC function

Author keywords

subgradient; DC function; Nonconvex optimization; Nonsmooth optimization; Proximal point algorithm

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS;

EID: 0142261105     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (68)

References (25)
  • 1
    • 24844463748 scopus 로고
    • Duality algorithm for nonconvex variational principle
    • Research Report UH/MD-41, University of Houston
    • G. Auchmuty, Duality algorithm for nonconvex variational principle, Research Report UH/MD-41, University of Houston, (1988).
    • (1988)
    • Auchmuty, G.1
  • 3
    • 84966240716 scopus 로고
    • Critical points approximation through exact regularization
    • E. Fernandez-Cara and C. Moreno, Critical points approximation through exact regularization, Mathematics of Computation, 50 (1988) 139-153.
    • (1988) Mathematics of Computation , vol.50 , pp. 139-153
    • Fernandez-Cara, E.1    Moreno, C.2
  • 4
    • 0021503955 scopus 로고
    • A descent algorithm for nonsmooth convex optimization
    • M. Fukushima, A descent algorithm for nonsmooth convex optimization, Mathematical Programming, 30 (1984), 163-175.
    • (1984) Mathematical Programming , vol.30 , pp. 163-175
    • Fukushima, M.1
  • 5
    • 0030508716 scopus 로고    scopus 로고
    • A globally and superlinearly convergent algorithm for nonsmooth convex minimization
    • M. Fukushima and L. Qi, A globally and superlinearly convergent algorithm for nonsmooth convex minimization, SIAM J. Optimization, 6 (1996), 1106-1120.
    • (1996) SIAM J. Optimization , vol.6 , pp. 1106-1120
    • Fukushima, M.1    Qi, L.2
  • 6
    • 0002191897 scopus 로고
    • From convex optimization to nonconvex optimization, necessary and sufficient conditions for global optimization
    • Plenum Press
    • J.B. Hiriart-Urruty, From convex optimization to nonconvex optimization, necessary and sufficient conditions for global optimization, Nonsmooth Optimization and Related Topics, Plenum Press, (1989), 219-240.
    • (1989) Nonsmooth Optimization and Related Topics , pp. 219-240
    • Hiriart-Urruty, J.B.1
  • 7
    • 0001780949 scopus 로고
    • Generalized differenciability, duality and optimization for problems dealing with difference of convex functions
    • Lecture Notes in Economics and Mathematical Systems 256
    • J.B. Hiriart-Urruty, Generalized differenciability, duality and optimization for problems dealing with difference of convex functions, Convexity and Duality in Optimization, Lecture Notes in Economics And Mathematical Systems 256, (1986), 37-70.
    • (1986) Convexity and Duality in Optimization , pp. 37-70
    • Hiriart-Urruty, J.B.1
  • 10
    • 0025208765 scopus 로고
    • Proximity control in bundle methods for convex non-differentiable minimization
    • K.C. Kiwiel, Proximity control in bundle methods for convex non-differentiable minimization, Mathematical Programming, 46 (1990), 105-122.
    • (1990) Mathematical Programming , vol.46 , pp. 105-122
    • Kiwiel, K.C.1
  • 11
    • 0019515893 scopus 로고
    • A minimization method for the sum of a convex function and a continuously different table function
    • H. Mine and M. Fukushima, A minimization method for the sum of a convex function and a continuously different table function, J. Optimization Theory and Applications, 33 (1981), 9-23.
    • (1981) J. Optimization Theory and Applications , vol.33 , pp. 9-23
    • Mine, H.1    Fukushima, M.2
  • 12
    • 0003317924 scopus 로고
    • Nonsmooth equations: Motivation and algorithms
    • J.S. Pang and L. Qi, Nonsmooth equations: motivation and algorithms, SIAM J. Optimization, 3 (1993), 443-465.
    • (1993) SIAM J. Optimization , vol.3 , pp. 443-465
    • Pang, J.S.1    Qi, L.2
  • 13
    • 0142145419 scopus 로고
    • Algorithms for solving a class of nonconvex optimizations problems: Methods of subgradient
    • North Holland
    • D.T. Pham and E.B. Souad, Algorithms for solving a class of nonconvex optimizations problems: methods of subgradient, Fermat Days 85: Mathematics for Optimization, North Holland, (1986).
    • (1986) Fermat Days 85: Mathematics for Optimization
    • Pham, D.T.1    Souad, E.B.2
  • 14
    • 0000607524 scopus 로고
    • Convergence analysis of some algorithms for solving nonsmooth equations
    • L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Mathematics of Operations Research, 18 (1993), 227-244.
    • (1993) Mathematics of Operations Research , vol.18 , pp. 227-244
    • Qi, L.1
  • 15
    • 0010181201 scopus 로고
    • An iterative method for minimax problem
    • Du D.Z. and Pardalos P.M. (ed.), Kluwer Academic Publisher, New York
    • L. Qi and W. Sun, An iterative method for minimax problem, in D.Z. Du and P.M. Pardalos eds., Minimax and Applications, (Kluwer Academic Publisher, New York, 1995), 55-67.
    • (1995) Minimax and Applications , pp. 55-67
    • Qi, L.1    Sun, W.2
  • 17
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control and Optimization, 14 (1976), 877-898.
    • (1976) SIAM J. Control and Optimization , vol.14 , pp. 877-898
    • Rockafellar, R.T.1
  • 19
    • 4243413803 scopus 로고
    • Contribution to study of dc programming
    • Doctoral Thesis, Catholic University of Rio de Janeiro
    • R.J.B. Sampaio, Contribution to study of dc programming, Doctoral Thesis, Catholic University of Rio de Janeiro, (1990).
    • (1990)
    • Sampaio, R.J.B.1
  • 21
    • 0142145416 scopus 로고    scopus 로고
    • On convergence of an iterative method for minimax problem
    • W. Sun, On convergence of an iterative method for minimax problem, J. Australian Mathematics Society, Series B, 39 (1997), 280-292.
    • (1997) J. Australian Mathematics Society, Series B , vol.39 , pp. 280-292
    • Sun, W.1


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