메뉴 건너뛰기




Volumn 2241, Issue , 2001, Pages 112-156

Lagrangian relaxation

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; OPTIMAL SYSTEMS;

EID: 84858898840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45586-8_4     Document Type: Conference Paper
Times cited : (190)

References (76)
  • 1
    • 0003169116 scopus 로고
    • Interior point methods in semidefinite programming with applications to combinatorial optimization
    • F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13–51, 1995.
    • (1995) SIAM Journal on Optimization , vol.5 , Issue.1 , pp. 13-51
    • Alizadeh, F.1
  • 3
    • 0000377218 scopus 로고
    • Projected Newton methods for optimization problems with simple constraints
    • D.P. Bertsekas. Projected Newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20:221–246, 1982.
    • (1982) SIAM Journal on Control and Optimization , vol.20 , pp. 221-246
    • Bertsekas, D.P.1
  • 4
    • 0021501063 scopus 로고
    • Equivalence of some quadratic programming algorithms
    • M.J. Best. Equivalence of some quadratic programming algorithms. Mathematical Programming, 30:71–87, 1984.
    • (1984) Mathematical Programming , vol.30 , pp. 71-87
    • Best, M.J.1
  • 7
    • 0000882113 scopus 로고
    • Newton’s method for convex programming and Tchebycheff approximations
    • E. Cheney and A. Goldstein. 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
  • 8
    • 33646971357 scopus 로고
    • Convergence of some algorithms for convex minimization
    • R. Correa and C. Lemaréchal. Convergence of some algorithms for convex minimization. Mathematical Programming, 62(2):261–275, 1993.
    • (1993) Mathematical Programming , vol.62 , Issue.2 , pp. 261-275
    • Correa, R.1    Lemaréchal, C.2
  • 9
    • 0000493799 scopus 로고
    • Dual methods in entropy maximization. Application to some problems in crystallography
    • A. Decarreau, D. Hilhorst, C. Lemarechal, and J. Navaza. Dual methods in entropy maximization. application to some problems in crystallography. SIAM Journal on Optimization, 2(2):173–197, 1992.
    • (1992) SIAM Journal on Optimization , vol.2 , Issue.2 , pp. 173-197
    • Decarreau, A.1    Hilhorst, D.2    Lemarechal, C.3    Navaza, J.4
  • 11
    • 34250521052 scopus 로고
    • Methods of solution of nonlinear extremal problems
    • Y.M. Ermol’ev. Methods of solution of nonlinear extremal problems. Kibernetica, 2(4):1–17, 1966.
    • (1966) Kibernetica , vol.2 , Issue.4 , pp. 1-17
    • Ermol’Ev, Y.M.1
  • 12
    • 0000703172 scopus 로고
    • Generalized lagrange multiplier method for solving problems of optimum allocation of resources
    • H. Everett III. Generalized lagrange multiplier method for solving problems of optimum allocation of resources. Operations Research, 11:399–417, 1963.
    • (1963) Operations Research , vol.11 , pp. 399-417
    • Everett, H.1
  • 13
    • 0001759710 scopus 로고
    • Lagrange multipliers and nonconvex programs
    • J.E. Falk. Lagrange multipliers and nonconvex programs. SIAM Journal on Control, 7(4):534–545, 1969.
    • (1969) SIAM Journal on Control , vol.7 , Issue.4 , pp. 534-545
    • Falk, J.E.1
  • 14
    • 0034377204 scopus 로고    scopus 로고
    • Dual applications of proximal bundle methods, including lagrangian relaxation of nonconvex problems
    • S. Feltenmark and K. C. Kiwiel. Dual applications of proximal bundle methods, including lagrangian relaxation of nonconvex problems. SIAM Journal on Optimization, 10(3):697–721, 2000.
    • (2000) SIAM Journal on Optimization , vol.10 , Issue.3 , pp. 697-721
    • Feltenmark, S.1    Kiwiel, K.C.2
  • 16
    • 0030284068 scopus 로고    scopus 로고
    • Solving semidefinite quadratic problems within nonsmooth optimization algorithms
    • A. Frangioni. Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Computational Operational Research, 23(11):1099–1118, 1996.
    • (1996) Computational Operational Research , vol.23 , Issue.11 , pp. 1099-1118
    • Frangioni, A.1
  • 17
    • 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 Journal on Optimization, 6:1106–1120, 1996.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 1106-1120
    • Fukushima, M.1    Qi, L.2
  • 19
    • 0002554041 scopus 로고
    • Lagrangean relaxation for integer programming
    • A.M. Geoffrion. Lagrangean relaxation for integer programming. Mathematical Programming Study, 2:82–114, 1974.
    • (1974) Mathematical Programming Study , vol.2 , pp. 82-114
    • Geoffrion, A.M.1
  • 20
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 6:1115–1145, 1995.
    • (1995) Journal of the ACM , vol.6 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 21
    • 0000949338 scopus 로고
    • Decomposition and nondifferentiable optimization with the projective algorithm
    • J.L. Goffin, A. Haurie, and J.Ph. Vial. Decomposition and nondifferentiable optimization with the projective algorithm. Management Science, 38(2):284–302, 1992.
    • (1992) Management Science , vol.38 , Issue.2 , pp. 284-302
    • Goffin, J.L.1    Haurie, A.2    Vial, J.3
  • 22
    • 85047681687 scopus 로고    scopus 로고
    • Convex nondifferentiable optimization: A survey focussed on the analytic center cutting plane method
    • Univ. of Geneva, Switzerland
    • J.L. Goffin and J.Ph. Vial. Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method. to appear in Optimization Methods and Software; also as HEC/Logilab Technical Report 99.02, Univ. of Geneva, Switzerland.
    • Optimization Methods and Software; also as Hec/Logilab Technical Report 99.02
    • Goffin, J.L.1    Vial, J.2
  • 23
    • 34250461535 scopus 로고
    • The travelling salesman problem and minimum spanning trees: Part II
    • M. Held and R. Karp. The travelling salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1:6–25, 1971.
    • (1971) Mathematical Programming , vol.1 , pp. 6-25
    • Held, M.1    Karp, R.2
  • 24
    • 0034415006 scopus 로고    scopus 로고
    • A spectral bundle method for semidefinite programming
    • C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10(3):673–696, 2000.
    • (2000) SIAM Journal on Optimization , vol.10 , Issue.3 , pp. 673-696
    • Helmberg, C.1    Rendl, F.2
  • 27
    • 0004151494 scopus 로고
    • Cambridge University Press, (New edition, 1999)
    • R.A. Horn and Ch.R. Johnson. Matrix Analysis. Cambridge University Press, 1989. (New edition, 1999).
    • (1989) Matrix Analysis
    • Horn, R.A.1    Johnson, C.2
  • 28
    • 0001547779 scopus 로고
    • The cutting plane method for solving convex programs
    • J. E. Kelley. 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
  • 29
    • 0003970531 scopus 로고
    • Methods of Descent for Nondifferentiable Optimization
    • Springer Verlag, Heidelberg
    • K.C. Kiwiel. Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133. Springer Verlag, Heidelberg, 1985.
    • (1985) Lecture Notes in Mathematics 1133
    • Kiwiel, K.C.1
  • 30
    • 0001260166 scopus 로고
    • A method for solving certain quadratic programming problems arising in nonsmooth optimization
    • K.C. Kiwiel. 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.C.1
  • 31
    • 0000121139 scopus 로고
    • A dual method for certain positive semidefinite quadratic programming problems
    • K.C. Kiwiel. A dual method for certain positive semidefinite quadratic programming problems. SIAM Journal on Scientific and Statistical Computing, 10:175–186, 1989.
    • (1989) SIAM Journal on Scientific and Statistical Computing , vol.10 , pp. 175-186
    • Kiwiel, K.C.1
  • 32
    • 0025208765 scopus 로고
    • Proximity control in bundle methods for convex nondifferentiable minimization
    • K.C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Mathematical Programming, 46(1):105–122, 1990.
    • (1990) Mathematical Programming , vol.46 , Issue.1 , pp. 105-122
    • Kiwiel, K.C.1
  • 34
    • 0033077459 scopus 로고    scopus 로고
    • The efficiency of ballstep subgradient level methods for convex optimization
    • K.C. Kiwiel, T. Larsson, and P.O. Lindberg. The efficiency of ballstep subgradient level methods for convex optimization. Mathematics of Operations Research, 24(1):237–254, 1999.
    • (1999) Mathematics of Operations Research , vol.24 , Issue.1 , pp. 237-254
    • Kiwiel, K.C.1    Larsson, T.2    Lindberg, P.O.3
  • 35
    • 0037876458 scopus 로고    scopus 로고
    • Ergodic, primal convergence in dual subgradient schemes for convex programming
    • T. Larsson, M. Patriksson, and A.B. Strömberg. Ergodic, primal convergence in dual subgradient schemes for convex programming. Mathematical Programming, 86(2):283–312, 1999.
    • (1999) Mathematical Programming , vol.86 , Issue.2 , pp. 283-312
    • Larsson, T.1    Patriksson, M.2    Strömberg, A.B.3
  • 38
    • 0006355286 scopus 로고    scopus 로고
    • Semi-definite relaxations and lagrangian duality with application to combinatorial optimization
    • C. Lemaréchal and F. Oustry. Semi-definite relaxations and lagrangian duality with application to combinatorial optimization. Rapport de Recherche 3710, Inria, 1999. http://www.inria.fr/rrrt/rr-3710.html.
    • (1999) Rapport De Recherche 3710, Inria
    • Lemaréchal, C.1    Oustry, F.2
  • 42
    • 0344794572 scopus 로고    scopus 로고
    • A geometric study of duality gaps, with applications
    • C. Lemaréchal and A. Renaud. A geometric study of duality gaps, with applications. Mathematical Programming, 90(3):399–427, 2001.
    • (2001) Mathematical Programming , vol.90 , Issue.3 , pp. 399-427
    • Lemaréchal, C.1    Renaud, A.2
  • 43
    • 0000275440 scopus 로고    scopus 로고
    • Variable metric bundle methods: From conceptual to implementable forms
    • C. Lemaréchal and C. Sagastizábal. Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming, 76(3):393–410, 1997.
    • (1997) Mathematical Programming , vol.76 , Issue.3 , pp. 393-410
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 44
    • 0020766867 scopus 로고
    • Some remarks on the construction of higher order algorithms in convex optimization
    • C. Lemaréchal and J. Zowe. Some remarks on the construction of higher order algorithms in convex optimization. Applied Mathematics and Optimization, 10(1):51–68, 1983.
    • (1983) Applied Mathematics and Optimization , vol.10 , Issue.1 , pp. 51-68
    • Lemaréchal, C.1    Zowe, J.2
  • 45
    • 0041693748 scopus 로고
    • The eclipsing concept to approximate a multi-valued mapping
    • C. Lemaréchal and J. Zowe. The eclipsing concept to approximate a multi-valued mapping. Optimization, 22(1):3–37, 1991.
    • (1991) Optimization , vol.22 , Issue.1 , pp. 3-37
    • Lemaréchal, C.1    Zowe, J.2
  • 48
    • 0002450587 scopus 로고    scopus 로고
    • A bundle-newton method for nonsmooth unconstrained minimization
    • L. Luksan and J. Vlcek. A bundle-newton method for nonsmooth unconstrained minimization. Mathematical Programming, 83A(3):373–391, 1998.
    • (1998) Mathematical Programming , vol.83 A , Issue.3 , pp. 373-391
    • Luksan, L.1    Vlcek, J.2
  • 49
    • 0016972388 scopus 로고
    • Generalized linear programming solves the dual
    • T.L. Magnanti, J.F. Shapiro, and M.H. Wagner. Generalized linear programming solves the dual. Management Science, 22(11):1195–1203, 1976.
    • (1976) Management Science , vol.22 , Issue.11 , pp. 1195-1203
    • Magnanti, T.L.1    Shapiro, J.F.2    Wagner, M.H.3
  • 51
    • 0001844687 scopus 로고    scopus 로고
    • A quasi-second-order proximal bundle algorithm
    • R. Mifflin. A quasi-second-order proximal bundle algorithm. Mathematical Programming, 73(1):51–72, 1996.
    • (1996) Mathematical Programming , vol.73 , Issue.1 , pp. 51-72
    • Mifflin, R.1
  • 52
    • 0034353743 scopus 로고    scopus 로고
    • On VU-theory for functions with primal-dual gradient structure
    • R. Mifflin and C. Sagastizábal. On VU-theory for functions with primal-dual gradient structure. SIAM Journal on Optimization, 11(2):547–571, 2000.
    • (2000) SIAM Journal on Optimization , vol.11 , Issue.2 , pp. 547-571
    • Mifflin, R.1    Sagastizábal, C.2
  • 53
    • 0032222087 scopus 로고    scopus 로고
    • Quasi-Newton bundle-type methods for nondifferentiable convex optimization
    • R. Mifflin, D.F. Sun, and L.Q. Qi. 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.F.2    Qi, L.Q.3
  • 54
    • 0013438004 scopus 로고
    • Informational complexity and efficient methods for the solution of convex extremal problems
    • (in Russian. English translation: Matekon, 13, 3-25)
    • A.S. Nemirovskii and D. Yudin. Informational complexity and efficient methods for the solution of convex extremal problems. Ékonomika i Mathematicheskie Metody, 12:357–369, 1976. (in Russian. English translation: Matekon, 13, 3-25).
    • (1976) Ékonomika I Mathematicheskie Metody , vol.12 , pp. 357-369
    • Nemirovskii, A.S.1    Yudin, D.2
  • 55
    • 0029338609 scopus 로고
    • Complexity estimates of some cutting plane methods based on the analytic barrier
    • Yu.E. Nesterov. Complexity estimates of some cutting plane methods based on the analytic barrier. Mathematical Programming, 69(1):149–176, 1995.
    • (1995) Mathematical Programming , vol.69 , Issue.1 , pp. 149-176
    • Nesterov, Y.1
  • 59
    • 0002928322 scopus 로고    scopus 로고
    • A second-order bundle method to minimize the maximum eigenvalue function
    • F. Oustry. A second-order bundle method to minimize the maximum eigenvalue function. Mathematical Programming, 89(1):1–33, 2000.
    • (2000) Mathematical Programming , vol.89 , Issue.1 , pp. 1-33
    • Oustry, F.1
  • 60
    • 0002821681 scopus 로고
    • A recipe for semidefinite relaxation for (0,1)-quadratic programming
    • S. Poljak, F. Rendl, and H. Wolkowicz. A recipe for semidefinite relaxation for (0,1)-quadratic programming. Journal of Global Optimization, 7:51–73, 1995.
    • (1995) Journal of Global Optimization , vol.7 , pp. 51-73
    • Poljak, S.1    Rendl, F.2    Wolkowicz, H.3
  • 61
    • 0000686629 scopus 로고
    • A general method for solving extremum problems
    • B.T. Polyak. A general method for solving extremum problems. Soviet Mathematics Doklady, 8:593–597, 1967.
    • (1967) Soviet Mathematics Doklady , vol.8 , pp. 593-597
    • Polyak, B.T.1
  • 64
    • 0039218959 scopus 로고
    • Utilization of the operation of space dilatation in the minimization of convex functions
    • N. Shor. Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics, 6(1):7–15, 1970.
    • (1970) Cybernetics , vol.6 , Issue.1 , pp. 7-15
    • Shor, N.1
  • 66
    • 34250123478 scopus 로고
    • Method of opbtaining estimates in quadratic extremal probems with boolean variables
    • N.Z. Shor and A.S. Davydov. Method of opbtaining estimates in quadratic extremal probems with boolean variables. Cybernetics, 21(2):207–211, 1985.
    • (1985) Cybernetics , vol.21 , Issue.2 , pp. 207-211
    • Shor, N.Z.1    Davydov, A.S.2
  • 67
    • 33747813587 scopus 로고
    • A method for minimization, using the spacedilation operation in the direction of difference between two gradient sequences
    • N.Z. Shor and N.G. Zhurbenko. A method for minimization, using the spacedilation operation in the direction of difference between two gradient sequences. Cybernetics, 7(3):450–459, 1971.
    • (1971) Cybernetics , vol.7 , Issue.3 , pp. 450-459
    • Shor, N.Z.1    Zhurbenko, N.G.2
  • 68
    • 22444455025 scopus 로고    scopus 로고
    • The subdifferential and the directional derivatives of the maximum of a family of convex functions
    • V.N. Solov’ev. The subdifferential and the directional derivatives of the maximum of a family of convex functions. Izvestiya: Mathematics, 62(4):807–832, 1998.
    • (1998) Izvestiya: Mathematics , vol.62 , Issue.4 , pp. 807-832
    • Solov’Ev, V.N.1
  • 69
    • 0001292818 scopus 로고
    • An “analytical centre” for polyhedra and new classes of global algorithms for linear (Smooth, convex) programming
    • In A. Prékopa, J. Szelezsan, and B. Strazicky, editors, Springer Verlag, Berlin
    • G. Sonnevend. An “analytical centre” for polyhedra and new classes of global algorithms for linear (smooth, convex) programming. In A. Prékopa, J. Szelezsan, and B. Strazicky, editors, Proc. 12th IFIP Conf. System Modelling and Optimization, L.N. in Control and Information Sciences, pages 866–875. Springer Verlag, Berlin, 1986.
    • (1986) Proc. 12Th IFIP Conf. System Modelling and Optimization, L. N. In Control and Information Sciences , pp. 866-875
    • Sonnevend, G.1
  • 70
    • 79955476725 scopus 로고
    • A note on cutting-plane methods without nested constraint sets
    • D.M. Topkis. A note on cutting-plane methods without nested constraint sets. Operations Research, 18:1216–1224, 1970.
    • (1970) Operations Research , vol.18 , pp. 1216-1224
    • Topkis, D.M.1
  • 72
    • 0002513916 scopus 로고
    • Iterative methods for concave programming
    • K. Arrow, L. Hurwicz, and H. Uzawa, editors, Stanford University Press
    • H. Uzawa. Iterative methods for concave programming. In K. Arrow, L. Hurwicz, and H. Uzawa, editors, Studies in Linear and Nonlinear Programming, pages 154–165. Stanford University Press, 1959.
    • (1959) Studies in Linear and Nonlinear Programming , pp. 154-165
    • Uzawa, H.1
  • 73
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49–95, 1996.
    • (1996) SIAM Review , vol.38 , Issue.1 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 74
    • 0016621235 scopus 로고
    • A method of conjugate subgradients for minimizing nondifferentiable functions
    • P. Wolfe. A method of conjugate subgradients for minimizing nondifferentiable functions. Mathematical Programming Study, 3:145–173, 1975.
    • (1975) Mathematical Programming Study , vol.3 , pp. 145-173
    • Wolfe, P.1


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