American Institute of Mathematical Sciences

Advanced
July  2013, 9(3): 671-687. doi: 10.3934/jimo.2013.9.671

Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces

Gang Li 1, , Xiaoqi Yang 2, and  Yuying Zhou 3,

1. 

Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
2. 

Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
3. 

Department of Mathematics, Soochow University, Suzhou, 215006

Received  June 2011 Revised  March 2013 Published  April 2013

By using properties of dualizing parametrization functions, Lagrangian functions and the epigraph technique, some sufficient and necessary conditions of the stable strong duality and strong total duality for a class of DC optimization problems are established.
Keywords: epigraph, Conjugate functions, DC programming..
Mathematics Subject Classification: Primary: 90C26, 90C46; Secondary: 90C3.
Citation: Gang Li, Xiaoqi Yang, Yuying Zhou. Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces. Journal of Industrial & Management Optimization, 2013, 9 (3) : 671-687. doi: 10.3934/jimo.2013.9.671
References:
[1]

J. M. Borwein and A. S. Lewis, Partially finite convex programming, part I: Quasi relative interiors and duality theory,, Math. Program., 57 (1992), 15.  doi: 10.1007/BF01581072.  Google Scholar

[2]

R. I. Boţ, E. R. Csetnek and G. Wanka, Regularity conditions via quasi-relative interior in convex programming,, SIAM J. Optim., 19 (2008), 217.  doi: 10.1137/07068432X.  Google Scholar

[3]

R. I. Boţ, S. M. Grad and G. Wanka, On strong and total Lagrange duality for convex optimization problems,, J. Math. Anal. Appl., 337 (2008), 1315.  doi: 10.1016/j.jmaa.2007.04.071.  Google Scholar

[4]

R. I. Boţ, S. M. Grad and G. Wanka, New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces,, Nonlinear Anal., 69 (2008), 323.  doi: 10.1016/j.na.2007.05.021.  Google Scholar

[5]

R. S. Burachik and V. Jeyakumar, A dual condition for the convex subdifferential sum formula with applications,, J. Convex Anal., 12 (2005), 279.   Google Scholar

[6]

R. S. Burachik and V. Jeyakumar, A simple closure condition for the normal cone intersection formula,, Proc. Amer. Math. Soc., 133 (2005), 1741.  doi: 10.1090/S0002-9939-04-07844-X.  Google Scholar

[7]

R. S. Burachik, V. Jeyakumar and Z. Y. Wu, Necessary and sufficient conditions for stable conjugate duality,, Nonlinear Anal., 64 (2006), 1998.  doi: 10.1016/j.na.2005.07.034.  Google Scholar

[8]

B. D. Craven, "Mathematical Programming and Control Theory,", Chapman and Hall, (1978).   Google Scholar

[9]

N. Dinh, T. T. A. Nghia and G. Vallet, A closedness condition and its applications to DC programs with convex constraints,, Optimization, 59 (2010), 541.  doi: 10.1080/02331930801951348.  Google Scholar

[10]

D. H. Fang, C. Li and X. Q. Yang, Stable and total Fenchel duality for DC optimization problems in locally convex spaces,, SIAM J. Optim., 21 (2011), 730.  doi: 10.1137/100789749.  Google Scholar

[11]

M. S. Gowda and M. Teboulle, A comparison of constraint qualifications in infinite dimensional convex programming,, SIAM J. Control Optim., 28 (1990), 925.  doi: 10.1137/0328051.  Google Scholar

[12]

V. Jeyakumar and B. M. Glover, Characterizing global optimality for DC optimization problems under convex inequality constraints,, J. Global Optim., 8 (1996), 171.  doi: 10.1007/BF00138691.  Google Scholar

[13]

V. Jeyakumar and G. M. Lee, Complete characterizations of stable Farkas' lemma and cone-convex programming duality,, Math. Program., 114 (2008), 335.  doi: 10.1007/s10107-007-0104-x.  Google Scholar

[14]

B. Lemaire and M. Volle, Duality in DC programming,, in, (1998), 331.  doi: 10.1007/978-1-4613-3341-8_15.  Google Scholar

[15]

C. Li, D. H. Fang, G. López and M. A. López, Stable and total Fenchel duality for convex optimization problems in locally convex spaces,, SIAM, 20 (2009), 1032.  doi: 10.1137/080734352.  Google Scholar

[16]

C. Li, F. Ng and T. K. Pong, The SECQ, linear regularity and the strong CHIP for infinite system of closed convex sets in normed linear spaces,, SIAM J. Optim., 18 (2007), 643.  doi: 10.1137/060652087.  Google Scholar

[17]

J. E. Martinez-Legaz and M. Volle, Duality in DC programming: The case of several constraints,, J. Math. Anal. Appl., 237 (1999), 657.  doi: 10.1006/jmaa.1999.6496.  Google Scholar

[18]

R. T. Rockafellar, "Conjuagate Duality and Optimization,", Conference Board of the Mathematical Sciences Regional Conference Series in Applied Mathematics 16, (1974).   Google Scholar

[19]

X. T. Xiao, J. Gu, L. W. Zhang and S. W. Zhang, A sequential convex program method to DC program with joint chance constraints,, J. Ind. Manag. Optim., 8 (2012), 733.  doi: 10.3934/jimo.2012.8.733.  Google Scholar

[20]

C. Zălinescu, "Convex Analysis in General Vector Space,", World Sciencetific Publishing, (2002).  doi: 10.1142/9789812777096.  Google Scholar

show all references

References:
[1]

J. M. Borwein and A. S. Lewis, Partially finite convex programming, part I: Quasi relative interiors and duality theory,, Math. Program., 57 (1992), 15.  doi: 10.1007/BF01581072.  Google Scholar

[2]

R. I. Boţ, E. R. Csetnek and G. Wanka, Regularity conditions via quasi-relative interior in convex programming,, SIAM J. Optim., 19 (2008), 217.  doi: 10.1137/07068432X.  Google Scholar

[3]

R. I. Boţ, S. M. Grad and G. Wanka, On strong and total Lagrange duality for convex optimization problems,, J. Math. Anal. Appl., 337 (2008), 1315.  doi: 10.1016/j.jmaa.2007.04.071.  Google Scholar

[4]

R. I. Boţ, S. M. Grad and G. Wanka, New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces,, Nonlinear Anal., 69 (2008), 323.  doi: 10.1016/j.na.2007.05.021.  Google Scholar

[5]

R. S. Burachik and V. Jeyakumar, A dual condition for the convex subdifferential sum formula with applications,, J. Convex Anal., 12 (2005), 279.   Google Scholar

[6]

R. S. Burachik and V. Jeyakumar, A simple closure condition for the normal cone intersection formula,, Proc. Amer. Math. Soc., 133 (2005), 1741.  doi: 10.1090/S0002-9939-04-07844-X.  Google Scholar

[7]

R. S. Burachik, V. Jeyakumar and Z. Y. Wu, Necessary and sufficient conditions for stable conjugate duality,, Nonlinear Anal., 64 (2006), 1998.  doi: 10.1016/j.na.2005.07.034.  Google Scholar

[8]

B. D. Craven, "Mathematical Programming and Control Theory,", Chapman and Hall, (1978).   Google Scholar

[9]

N. Dinh, T. T. A. Nghia and G. Vallet, A closedness condition and its applications to DC programs with convex constraints,, Optimization, 59 (2010), 541.  doi: 10.1080/02331930801951348.  Google Scholar

[10]

D. H. Fang, C. Li and X. Q. Yang, Stable and total Fenchel duality for DC optimization problems in locally convex spaces,, SIAM J. Optim., 21 (2011), 730.  doi: 10.1137/100789749.  Google Scholar

[11]

M. S. Gowda and M. Teboulle, A comparison of constraint qualifications in infinite dimensional convex programming,, SIAM J. Control Optim., 28 (1990), 925.  doi: 10.1137/0328051.  Google Scholar

[12]

V. Jeyakumar and B. M. Glover, Characterizing global optimality for DC optimization problems under convex inequality constraints,, J. Global Optim., 8 (1996), 171.  doi: 10.1007/BF00138691.  Google Scholar

[13]

V. Jeyakumar and G. M. Lee, Complete characterizations of stable Farkas' lemma and cone-convex programming duality,, Math. Program., 114 (2008), 335.  doi: 10.1007/s10107-007-0104-x.  Google Scholar

[14]

B. Lemaire and M. Volle, Duality in DC programming,, in, (1998), 331.  doi: 10.1007/978-1-4613-3341-8_15.  Google Scholar

[15]

C. Li, D. H. Fang, G. López and M. A. López, Stable and total Fenchel duality for convex optimization problems in locally convex spaces,, SIAM, 20 (2009), 1032.  doi: 10.1137/080734352.  Google Scholar

[16]

C. Li, F. Ng and T. K. Pong, The SECQ, linear regularity and the strong CHIP for infinite system of closed convex sets in normed linear spaces,, SIAM J. Optim., 18 (2007), 643.  doi: 10.1137/060652087.  Google Scholar

[17]

J. E. Martinez-Legaz and M. Volle, Duality in DC programming: The case of several constraints,, J. Math. Anal. Appl., 237 (1999), 657.  doi: 10.1006/jmaa.1999.6496.  Google Scholar

[18]

R. T. Rockafellar, "Conjuagate Duality and Optimization,", Conference Board of the Mathematical Sciences Regional Conference Series in Applied Mathematics 16, (1974).   Google Scholar

[19]

X. T. Xiao, J. Gu, L. W. Zhang and S. W. Zhang, A sequential convex program method to DC program with joint chance constraints,, J. Ind. Manag. Optim., 8 (2012), 733.  doi: 10.3934/jimo.2012.8.733.  Google Scholar

[20]

C. Zălinescu, "Convex Analysis in General Vector Space,", World Sciencetific Publishing, (2002).  doi: 10.1142/9789812777096.  Google Scholar

[1]

Dag Lukkassen, Annette Meidell, Peter Wall. On the conjugate of periodic piecewise harmonic functions. Networks & Heterogeneous Media, 2008, 3 (3) : 633-646. doi: 10.3934/nhm.2008.3.633
[2]

Gang Li, Lipu Zhang, Zhe Liu. The stable duality of DC programs for composite convex functions. Journal of Industrial & Management Optimization, 2017, 13 (1) : 63-79. doi: 10.3934/jimo.2016004
[3]

Changzhi Wu, Chaojie Li, Qiang Long. A DC programming approach for sensor network localization with uncertainties in anchor positions. Journal of Industrial & Management Optimization, 2014, 10 (3) : 817-826. doi: 10.3934/jimo.2014.10.817
[4]

Jian Gu, Xiantao Xiao, Liwei Zhang. A subgradient-based convex approximations method for DC programming and its applications. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1349-1366. doi: 10.3934/jimo.2016.12.1349
[5]

Yuying Zhou, Gang Li. The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions. Numerical Algebra, Control & Optimization, 2014, 4 (1) : 9-23. doi: 10.3934/naco.2014.4.9
[6]

Le Thi Hoai An, Tran Duc Quynh, Pham Dinh Tao. A DC programming approach for a class of bilevel programming problems and its application in Portfolio Selection. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 167-185. doi: 10.3934/naco.2012.2.167
[7]

Yanjun Wang, Kaiji Shen. A new concave reformulation and its application in solving DC programming globally under uncertain environment. Journal of Industrial & Management Optimization, 2020, 16 (5) : 2351-2367. doi: 10.3934/jimo.2019057
[8]

Oliver Junge, Alex Schreiber. Dynamic programming using radial basis functions. Discrete & Continuous Dynamical Systems - A, 2015, 35 (9) : 4439-4453. doi: 10.3934/dcds.2015.35.4439
[9]

Huijuan Li, Robert Baier, Lars Grüne, Sigurdur F. Hafstein, Fabian R. Wirth. Computation of local ISS Lyapunov functions with low gains via linear programming. Discrete & Continuous Dynamical Systems - B, 2015, 20 (8) : 2477-2495. doi: 10.3934/dcdsb.2015.20.2477
[10]

Bao Qing Hu, Song Wang. A novel approach in uncertain programming part II: a class of constrained nonlinear programming problems with interval objective functions. Journal of Industrial & Management Optimization, 2006, 2 (4) : 373-385. doi: 10.3934/jimo.2006.2.373
[11]

Chetan D. Pahlajani. Randomly perturbed switching dynamics of a dc/dc converter. Discrete & Continuous Dynamical Systems - B, 2017, 22 (2) : 569-584. doi: 10.3934/dcdsb.2017027
[12]

Jeongmin Han. Local Lipschitz regularity for functions satisfying a time-dependent dynamic programming principle. Communications on Pure & Applied Analysis, 2020, 19 (5) : 2617-2640. doi: 10.3934/cpaa.2020114
[13]

Yanqin Bai, Pengfei Ma, Jing Zhang. A polynomial-time interior-point method for circular cone programming based on kernel functions. Journal of Industrial & Management Optimization, 2016, 12 (2) : 739-756. doi: 10.3934/jimo.2016.12.739
[14]

Anurag Jayswal, Ashish Kumar Prasad, Izhar Ahmad. On minimax fractional programming problems involving generalized $(H_p,r)$-invex functions. Journal of Industrial & Management Optimization, 2014, 10 (4) : 1001-1018. doi: 10.3934/jimo.2014.10.1001
[15]

E. Fossas-Colet, J.M. Olm-Miras. Asymptotic tracking in DC-to-DC nonlinear power converters. Discrete & Continuous Dynamical Systems - B, 2002, 2 (2) : 295-307. doi: 10.3934/dcdsb.2002.2.295
[16]

József Abaffy. A new reprojection of the conjugate directions. Numerical Algebra, Control & Optimization, 2019, 9 (2) : 157-171. doi: 10.3934/naco.2019012
[17]

Lei Zhang, Anfu Zhu, Aiguo Wu, Lingling Lv. Parametric solutions to the regulator-conjugate matrix equations. Journal of Industrial & Management Optimization, 2017, 13 (2) : 623-631. doi: 10.3934/jimo.2016036
[18]

Manxue You, Shengjie Li. Perturbation of Image and conjugate duality for vector optimization. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020176
[19]

Anulekha Dhara, Aparna Mehra. Conjugate duality for generalized convex optimization problems. Journal of Industrial & Management Optimization, 2007, 3 (3) : 415-427. doi: 10.3934/jimo.2007.3.415
[20]

Xiantao Xiao, Jian Gu, Liwei Zhang, Shaowu Zhang. A sequential convex program method to DC program with joint chance constraints. Journal of Industrial & Management Optimization, 2012, 8 (3) : 733-747. doi: 10.3934/jimo.2012.8.733

2019 Impact Factor: 1.366

Tools

Metrics

  • PDF downloads (27)
  • HTML views (0)
  • Cited by (3)

Other articles
by authors

[Back to Top]

Copyright © 2021 American Institute of Mathematical Sciences