• Previous Article
    $H_\infty$ optimal stabilization of a class of uncertain impulsive systems: An LMI approach
  • JIMO Home
  • This Issue
  • Next Article
    An optimization approach to the estimation of effective drug diffusivity: From a planar disc into a finite external volume
January  2009, 5(1): 141-151. doi: 10.3934/jimo.2009.5.141

A smoothing approach for semi-infinite programming with projected Newton-type algorithm

1. 

College of Mathematics and Computer Science, Chongqing Normal University, Chongqing, China

2. 

Department of Mathematics and Statistics, Curtin University, G.P.O. Box U1987, Perth, WA 6845

3. 

Curtin University of Technology, Bentley WA

Received  January 2008 Revised  July 2008 Published  December 2008

In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming problems. The infinite constraints are replaced by an equivalent nonsmooth function which is then approximated by a smoothing function. The KKT system is formulated as a nonsmooth equation. We then apply the projected Newton-type algorithm to solve this equation and show that the accumulation point satisfies the KKT system. Some numerical results are presented for illustration.
Citation: Zhi Guo Feng, Kok Lay Teo, Volker Rehbock. A smoothing approach for semi-infinite programming with projected Newton-type algorithm. Journal of Industrial and Management Optimization, 2009, 5 (1) : 141-151. doi: 10.3934/jimo.2009.5.141
[1]

Xiaojiao Tong, Shuzi Zhou. A smoothing projected Newton-type method for semismooth equations with bound constraints. Journal of Industrial and Management Optimization, 2005, 1 (2) : 235-250. doi: 10.3934/jimo.2005.1.235

[2]

Liping Zhang, Soon-Yi Wu, Shu-Cherng Fang. Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium problems. Journal of Industrial and Management Optimization, 2010, 6 (2) : 333-346. doi: 10.3934/jimo.2010.6.333

[3]

Na Zhao, Zheng-Hai Huang. A nonmonotone smoothing Newton algorithm for solving box constrained variational inequalities with a $P_0$ function. Journal of Industrial and Management Optimization, 2011, 7 (2) : 467-482. doi: 10.3934/jimo.2011.7.467

[4]

Hans J. Wolters. A Newton-type method for computing best segment approximations. Communications on Pure and Applied Analysis, 2004, 3 (1) : 133-149 . doi: 10.3934/cpaa.2004.3.133

[5]

Zheng-Hai Huang, Jie Sun. A smoothing Newton algorithm for mathematical programs with complementarity constraints. Journal of Industrial and Management Optimization, 2005, 1 (2) : 153-170. doi: 10.3934/jimo.2005.1.153

[6]

Xiaoqin Jiang, Ying Zhang. A smoothing-type algorithm for absolute value equations. Journal of Industrial and Management Optimization, 2013, 9 (4) : 789-798. doi: 10.3934/jimo.2013.9.789

[7]

Xiao-Hong Liu, Wei-Zhe Gu. Smoothing Newton algorithm based on a regularized one-parametric class of smoothing functions for generalized complementarity problems over symmetric cones. Journal of Industrial and Management Optimization, 2010, 6 (2) : 363-380. doi: 10.3934/jimo.2010.6.363

[8]

B. S. Goh, W. J. Leong, Z. Siri. Partial Newton methods for a system of equations. Numerical Algebra, Control and Optimization, 2013, 3 (3) : 463-469. doi: 10.3934/naco.2013.3.463

[9]

Hang Zheng, Yonghui Xia. Chaotic threshold of a class of hybrid piecewise-smooth system by an impulsive effect via Melnikov-type function. Discrete and Continuous Dynamical Systems - B, 2022  doi: 10.3934/dcdsb.2021319

[10]

Li-Xia Liu, Sanyang Liu, Chun-Feng Wang. Smoothing Newton methods for symmetric cone linear complementarity problem with the Cartesian $P$/$P_0$-property. Journal of Industrial and Management Optimization, 2011, 7 (1) : 53-66. doi: 10.3934/jimo.2011.7.53

[11]

Yanhong Yuan, Hongwei Zhang, Liwei Zhang. A smoothing Newton method for generalized Nash equilibrium problems with second-order cone constraints. Numerical Algebra, Control and Optimization, 2012, 2 (1) : 1-18. doi: 10.3934/naco.2012.2.1

[12]

Sanming Liu, Zhijie Wang, Chongyang Liu. Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems. Numerical Algebra, Control and Optimization, 2015, 5 (1) : 79-89. doi: 10.3934/naco.2015.5.79

[13]

Zheng-Hai Huang, Shang-Wen Xu. Convergence properties of a non-interior-point smoothing algorithm for the P*NCP. Journal of Industrial and Management Optimization, 2007, 3 (3) : 569-584. doi: 10.3934/jimo.2007.3.569

[14]

Jianjun Liu, Min Zeng, Yifan Ge, Changzhi Wu, Xiangyu Wang. Improved Cuckoo Search algorithm for numerical function optimization. Journal of Industrial and Management Optimization, 2020, 16 (1) : 103-115. doi: 10.3934/jimo.2018142

[15]

Basim A. Hassan. A new type of quasi-newton updating formulas based on the new quasi-newton equation. Numerical Algebra, Control and Optimization, 2020, 10 (2) : 227-235. doi: 10.3934/naco.2019049

[16]

Peili Li, Xiliang Lu, Yunhai Xiao. Smoothing Newton method for $ \ell^0 $-$ \ell^2 $ regularized linear inverse problem. Inverse Problems and Imaging, 2022, 16 (1) : 153-177. doi: 10.3934/ipi.2021044

[17]

Yan Li, Liping Zhang. A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with $ P_0 $ mappings. Journal of Industrial and Management Optimization, 2022  doi: 10.3934/jimo.2022041

[18]

Yulin Zhao. On the monotonicity of the period function of a quadratic system. Discrete and Continuous Dynamical Systems, 2005, 13 (3) : 795-810. doi: 10.3934/dcds.2005.13.795

[19]

Z.Y. Wu, H.W.J. Lee, F.S. Bai, L.S. Zhang. Quadratic smoothing approximation to $l_1$ exact penalty function in global optimization. Journal of Industrial and Management Optimization, 2005, 1 (4) : 533-547. doi: 10.3934/jimo.2005.1.533

[20]

Silvia Cingolani, Mnica Clapp, Simone Secchi. Intertwining semiclassical solutions to a Schrödinger-Newton system. Discrete and Continuous Dynamical Systems - S, 2013, 6 (4) : 891-908. doi: 10.3934/dcdss.2013.6.891

2020 Impact Factor: 1.801

Metrics

  • PDF downloads (62)
  • HTML views (0)
  • Cited by (5)

Other articles
by authors

[Back to Top]