메뉴 건너뛰기




Volumn , Issue , 2014, Pages

Conic geometric programming

Author keywords

[No Author keywords available]

Indexed keywords

BLENDING; CONVEX OPTIMIZATION; CONVEX PROGRAMMING; DYNAMICAL SYSTEMS; INFORMATION SCIENCE; LINEAR PROGRAMMING; OPTIMIZATION; QUANTUM OPTICS;

EID: 84901457624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2014.6814151     Document Type: Conference Paper
Times cited : (4)

References (23)
  • 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:13-51, 1995.
    • (1995) SIAM Journal on Optimization , vol.5 , pp. 13-51
    • Alizadeh, F.1
  • 4
    • 29244456551 scopus 로고    scopus 로고
    • Digital circuit optimization via geometric programming
    • DOI 10.1287/opre.1050.0254
    • S. Boyd, S. J. Kim, D. Patil, and M. Horowitz. Digital circuit optimization via geometric programming. Operations Research, 53:899-932, 2005. (Pubitemid 43061808)
    • (2005) Operations Research , vol.53 , Issue.6 , pp. 899-932
    • Boyd, S.P.1    Kim, S.-J.2    Patil, D.D.3    Horowitz, M.A.4
  • 8
    • 10744227892 scopus 로고    scopus 로고
    • Geometric programming duals of channel capacity and rate distortion
    • M. Chiang and S. Boyd. Geometric programming duals of channel capacity and rate distortion. IEEE Transactions on Information Theory, 50:245-258, 2004.
    • (2004) IEEE Transactions on Information Theory , vol.50 , pp. 245-258
    • Chiang, M.1    Boyd, S.2
  • 11
    • 4844227271 scopus 로고    scopus 로고
    • An extended conic formulation for geometric optimization
    • F. Glineur. An extended conic formulation for geometric optimization. Foundations of Computing and Decision Sciences, 25:161-174, 2000. (Pubitemid 33230496)
    • (2000) FOUNDATIONS of COMPUTING and DECISION SCIENCES , vol.25 , Issue.3 , pp. 161-174
    • Glineur, F.1
  • 12
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
    • (1995) Journal of the ACM , vol.42 , pp. 1115-1145
    • Goemans, M.1    Williamson, D.2
  • 13
    • 0032028848 scopus 로고    scopus 로고
    • Approximate graph coloring by semidefinite programming
    • D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45:246-265, 1998. (Pubitemid 128505780)
    • (1998) Journal of the ACM , vol.45 , Issue.2 , pp. 246-265
    • Karger, D.1    Motwani, R.2    Sudan, M.3
  • 14
    • 0034363964 scopus 로고    scopus 로고
    • A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
    • N. Linial, A. Samorodnitsky, and A. Wigderson. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica, 20, 2000.
    • (2000) Combinatorica , pp. 20
    • Linial, N.1    Samorodnitsky, A.2    Wigderson, A.3
  • 17
    • 78549288866 scopus 로고    scopus 로고
    • Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization
    • B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Review, 52:471-501, 2010.
    • (2010) SIAM Review , vol.52 , pp. 471-501
    • Recht, B.1    Fazel, M.2    Parrilo, P.A.3
  • 19
    • 0001622601 scopus 로고
    • Weighted minimum trace factor analysis
    • A. Shapiro. Weighted minimum trace factor analysis. Psychometrika, 47:243-264, 1982.
    • (1982) Psychometrika , vol.47 , pp. 243-264
    • Shapiro, A.1
  • 20
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38:49-95, 1994. (Pubitemid 126610912)
    • (1996) SIAM Review , vol.38 , Issue.1 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 23
    • 0022708056 scopus 로고
    • Solving complex chemical equilibria using a geometric-programming based technique
    • T. Wall, D. Greening, and R. Woolsey. Solving complex chemical equilibria using a geometric programming based technique. Operations Research, 34:345-355, 1986. (Pubitemid 17467464)
    • (1986) Operations Research , vol.34 , Issue.3 , pp. 345-355
    • Thomas Wayne, W.1    Doran, G.2    Woolsey, R.E.D.3


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