An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization

Boshi  Tian; Xiaoqi Yang; Kaiwen  Meng

doi:10.3934/jimo.2016.12.949

Previous Article
Bounds for the spectral radius of nonnegative tensors
JIMO Home
This Issue
Next Article
The risk-averse newsvendor game with competition on demand

July 2016, 12(3): 949-973. doi: 10.3934/jimo.2016.12.949

An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization

Boshi Tian ^1, , Xiaoqi Yang ^2, and Kaiwen Meng ^3,

1.	Business School, Hunan University, Changsha 410082, Hunan Province, China
2.	Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
3.	School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China

Received February 2014 Revised April 2015 Published September 2015

Abstract
Related Papers

In this paper, we study inequality constrained nonlinear programming problems by virtue of an $\ell{\frac12}$-penalty function and a quadratic relaxation. Combining with an interior-point method, we propose an interior-point $\ell_{\frac12}$-penalty method. We introduce different kinds of constraint qualifications to establish the first-order necessary conditions for the quadratically relaxed problem. We apply the modified Newton method to a sequence of logarithmic barrier problems, and design some reliable algorithms. Moreover, we establish the global convergence results of the proposed method. We carry out numerical experiments on 266 inequality constrained optimization problems. Our numerical results show that the proposed method is competitive with some existing interior-point $\ell_1$-penalty methods in term of iteration numbers and better when comparing the values of the penalty parameter.

Keywords: quadratic relaxation, constraint qualification, Nonlinear programming, primal-dual interior-point method., lower-order penalty function.

Mathematics Subject Classification: Primary: 90C30; Secondary: 49M20, 90C5.

Citation: Boshi Tian, Xiaoqi Yang, Kaiwen Meng. An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization. Journal of Industrial & Management Optimization, 2016, 12 (3) : 949-973. doi: 10.3934/jimo.2016.12.949

References:

[1]	H. Y. Benson, A. Sen and D. F. Shanno, Interior-point methods for nonconvex nonlinear programming: Convergence analysis and computational performance,, , (2009). Google Scholar
[2]	H. Y. Benson, D. F. Shanno and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing,, Mathematical Programming, 99 (2004), 35. doi: 10.1007/s10107-003-0418-2. Google Scholar
[3]	R. H. Byrd, G. Lopez-Calva and J. Nocedal, A line search exact penalty method using steering rules,, Mathematical Programming, 133 (2012), 39. doi: 10.1007/s10107-010-0408-0. Google Scholar
[4]	R. H. Byrd, J. Nocedal and R. A. Waltz, Steering exact penalty methods for nonlinear programming,, Optimization Methods and Software, 23 (2008), 197. doi: 10.1080/10556780701394169. Google Scholar
[5]	R. Chartrand and V. Staneva, Restricted isometry properties and nonconvex compressive sensing,, Inverse Problems, 24 (2008). doi: 10.1088/0266-5611/24/3/035020. Google Scholar
[6]	L. Chen and D. Goldfarb, Interior-point $l_2$-penalty methods for nonlinear programming with strong global convergence properties,, Mathematical Programming, 108 (2006), 1. doi: 10.1007/s10107-005-0701-5. Google Scholar
[7]	L. Chen and D. Goldfarb, On the Fast Local Convergence of Interior-point $l_2$-penalty Methods for Nonlinear Programming,, Technical report, (2006). Google Scholar
[8]	X. J. Chen, Smoothing methods for nonsmooth, nonconvex minimization,, Mathematical Programming, 134 (2012), 71. doi: 10.1007/s10107-012-0569-0. Google Scholar
[9]	A. R. Conn, N. I. M. Gould, D. Orban and P. L. Toint, A primal-dual trust-region algorithm for non-convex nonlinear programming,, Mathematical Programming, 87 (2000), 215. doi: 10.1007/s101070050112. Google Scholar
[10]	F. E. Curtis, A penalty-interior-point algorithm for nonlinear constrained optimization,, Mathematical Programming Computation, 4 (2012), 181. doi: 10.1007/s12532-012-0041-4. Google Scholar
[11]	E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles,, Mathematical Programming, 91 (2002), 201. doi: 10.1007/s101070100263. Google Scholar
[12]	C. Durazzi, On the Newton interior-point method for nonlinear programming problems,, Journal of Optimization Theory and Applications, 104 (2000), 73. doi: 10.1023/A:1004624721836. Google Scholar
[13]	A. S. El-Bakry, R. A. Tapia, T. Tsuchiya and Y. Zhang, On the formulation and theory of the Newton interior-point method for nonlinear programming,, Journal of Optimization Theory and Applications, 89 (1996), 507. doi: 10.1007/BF02275347. Google Scholar
[14]	R. Fletcher, Practical Methods of Optimization,, Second edition. A Wiley-Interscience Publication, (1987). Google Scholar
[15]	P. E. Gill, W. Murray and M. H. Wright, Practical Optimization,, Academic Press, (1981). Google Scholar
[16]	N. I. M. Gould, P. L. Toint and D. Orban, An Interior-point $l_1$-penalty Method for Nonlinear Optimization,, Groupe d'études et de recherche en analyse des décisions, (2010). Google Scholar
[17]	M. Guignard, Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space,, SIAM Journal on Control, 7 (1969), 232. doi: 10.1137/0307016. Google Scholar
[18]	X. X. Huang and X. Q. Yang, Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions,, Journal of Optimization Theory and Applications, 116 (2003), 311. doi: 10.1023/A:1022503820909. Google Scholar
[19]	X. X. Huang and X. Q. Yang, A unified augmented Lagrangian approach to duality and exact penalization,, Mathematics of Operations Research, 28 (2003), 533. doi: 10.1287/moor.28.3.533.16395. Google Scholar
[20]	X. W. Liu and J. Sun, A robust primal-dual interior-point algorithm for nonlinear programs,, SIAM Journal on Optimization, 14 (2004), 1163. doi: 10.1137/S1052623402400641. Google Scholar
[21]	X. W. Liu and J. Sun, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions,, Journal of Optimization Theory and Applications, 125 (2005), 609. doi: 10.1007/s10957-005-2092-4. Google Scholar
[22]	Z. Q. Luo, J. S. Pang and D. Ralph, Mathematical Programs with Equilibrium Constraints,, Cambridge University Press, (1996). doi: 10.1017/CBO9780511983658. Google Scholar
[23]	K. W. Meng, S. J. Li and X. Q. Yang, A robust SQP method based on a smoothing lower order penalty functions,, Optimization, 58 (2009), 23. doi: 10.1080/02331930701761193. Google Scholar
[24]	K. W. Meng and X. Q. Yang, First- and second-order necessary conditions via exact penalty functions,, Journal of Optimization Theory and Applications, 165* (2015), 720. doi: 10.1007/s10957-014-0664-x. Google Scholar*
[25]	K. W. Meng and X. Q. Yang, Optimality conditions via exact penalty functions,, SIAM Journal on Optimization, 20 (2010), 3208. doi: 10.1137/090771016. Google Scholar
[26]	Z. Q. Meng, C. Y. Dang and X. Q. Yang, On the smoothing of the square-root exact penalty function for inequality constrained optimization,, Computational Optimization and Applications, 35 (2006), 375. doi: 10.1007/s10589-006-8720-6. Google Scholar
[27]	M. Mongeau and A. Sartenaer, Automatic decrease of the penalty parameter in exact penalty function methods,, European Journal of Operational Research, 83 (1995), 686. doi: 10.1016/0377-2217(93)E0339-Y. Google Scholar
[28]	A. S. Nemirovski and M. J. Todd, Interior-point methods for optimization,, Acta Numerica, 17 (2008), 191. doi: 10.1017/S0962492906370018. Google Scholar
[29]	J. Nocedal and S. J. Wright, Numerical Optimization,, Springer Verlag, (2006). Google Scholar
[30]	I. Pólik and T. Terlaky, Interior point methods for nonlinear optimization,, Nonlinear optimization, 1989* (2010), 215. doi: 10.1007/978-3-642-11339-0_4. Google Scholar*
[31]	R. T. Rockafellar and R. J. B. Wets, Variational Analysis,, Springer-Verlag, (1998). doi: 10.1007/978-3-642-02431-3. Google Scholar
[32]	A. M. Rubinov, B. M. Glover and X. Q. Yang, Decreasing functions with applications to penalization,, SIAM Journal on Optimization, 10 (1999), 289. doi: 10.1137/S1052623497326095. Google Scholar
[33]	D. F. Shanno and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods,, Mathematical Programming, 87 (2000), 303. doi: 10.1007/s101070050116. Google Scholar
[34]	G. Still and M. Streng, Optimality conditions in smooth nonlinear programming,, Journal of Optimization Theory and Applications, 90 (1996), 483. doi: 10.1007/BF02189792. Google Scholar
[35]	R. J. Vanderbei and D. F. Shanno, An interior-point algorithm for nonconvex nonlinear programming,, Computational Optimization and Applications, 13 (1999), 231. doi: 10.1023/A:1008677427361. Google Scholar
[36]	A. Wächter and L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,, Mathematical Programming, 106 (2006), 25. doi: 10.1007/s10107-004-0559-y. Google Scholar
[37]	S. J. Wright, Primal-dual Interior-Point Methods,, SIAM, (1987). doi: 10.1137/1.9781611971453. Google Scholar
[38]	Z. B. Xu, X. Y. Chang, F. M. Xu and H. Zhang, $L_{1/2}$ Regularization: A thresholding representation theory and a fast solver,, Neural Networks and Learning Systems, 23 (2012), 1013. Google Scholar
[39]	X. Q. Yang and Z. Q. Meng, Lagrange multipliers and calmness conditions of order $p$,, Mathematics of Operations Research, 32 (2007), 95. doi: 10.1287/moor.1060.0217. Google Scholar
[40]	X. Q. Yang, Z. Q. Meng, X. X. Huang and G. T. Y. Pong, Smoothing nonlinear penalty functions for constrained optimization problems,, Numerical Functional Analysis and Optimization, 24 (2003), 351. doi: 10.1081/NFA-120022928. Google Scholar
[41]	Y. Y. Ye, Interior Point Algorithms: Theory and Analysis,, Wiley-Interscience, (1997). doi: 10.1002/9781118032701. Google Scholar

show all references

References:

[1]	H. Y. Benson, A. Sen and D. F. Shanno, Interior-point methods for nonconvex nonlinear programming: Convergence analysis and computational performance,, , (2009). Google Scholar
[2]	H. Y. Benson, D. F. Shanno and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing,, Mathematical Programming, 99 (2004), 35. doi: 10.1007/s10107-003-0418-2. Google Scholar
[3]	R. H. Byrd, G. Lopez-Calva and J. Nocedal, A line search exact penalty method using steering rules,, Mathematical Programming, 133 (2012), 39. doi: 10.1007/s10107-010-0408-0. Google Scholar
[4]	R. H. Byrd, J. Nocedal and R. A. Waltz, Steering exact penalty methods for nonlinear programming,, Optimization Methods and Software, 23 (2008), 197. doi: 10.1080/10556780701394169. Google Scholar
[5]	R. Chartrand and V. Staneva, Restricted isometry properties and nonconvex compressive sensing,, Inverse Problems, 24 (2008). doi: 10.1088/0266-5611/24/3/035020. Google Scholar
[6]	L. Chen and D. Goldfarb, Interior-point $l_2$-penalty methods for nonlinear programming with strong global convergence properties,, Mathematical Programming, 108 (2006), 1. doi: 10.1007/s10107-005-0701-5. Google Scholar
[7]	L. Chen and D. Goldfarb, On the Fast Local Convergence of Interior-point $l_2$-penalty Methods for Nonlinear Programming,, Technical report, (2006). Google Scholar
[8]	X. J. Chen, Smoothing methods for nonsmooth, nonconvex minimization,, Mathematical Programming, 134 (2012), 71. doi: 10.1007/s10107-012-0569-0. Google Scholar
[9]	A. R. Conn, N. I. M. Gould, D. Orban and P. L. Toint, A primal-dual trust-region algorithm for non-convex nonlinear programming,, Mathematical Programming, 87 (2000), 215. doi: 10.1007/s101070050112. Google Scholar
[10]	F. E. Curtis, A penalty-interior-point algorithm for nonlinear constrained optimization,, Mathematical Programming Computation, 4 (2012), 181. doi: 10.1007/s12532-012-0041-4. Google Scholar
[11]	E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles,, Mathematical Programming, 91 (2002), 201. doi: 10.1007/s101070100263. Google Scholar
[12]	C. Durazzi, On the Newton interior-point method for nonlinear programming problems,, Journal of Optimization Theory and Applications, 104 (2000), 73. doi: 10.1023/A:1004624721836. Google Scholar
[13]	A. S. El-Bakry, R. A. Tapia, T. Tsuchiya and Y. Zhang, On the formulation and theory of the Newton interior-point method for nonlinear programming,, Journal of Optimization Theory and Applications, 89 (1996), 507. doi: 10.1007/BF02275347. Google Scholar
[14]	R. Fletcher, Practical Methods of Optimization,, Second edition. A Wiley-Interscience Publication, (1987). Google Scholar
[15]	P. E. Gill, W. Murray and M. H. Wright, Practical Optimization,, Academic Press, (1981). Google Scholar
[16]	N. I. M. Gould, P. L. Toint and D. Orban, An Interior-point $l_1$-penalty Method for Nonlinear Optimization,, Groupe d'études et de recherche en analyse des décisions, (2010). Google Scholar
[17]	M. Guignard, Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space,, SIAM Journal on Control, 7 (1969), 232. doi: 10.1137/0307016. Google Scholar
[18]	X. X. Huang and X. Q. Yang, Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions,, Journal of Optimization Theory and Applications, 116 (2003), 311. doi: 10.1023/A:1022503820909. Google Scholar
[19]	X. X. Huang and X. Q. Yang, A unified augmented Lagrangian approach to duality and exact penalization,, Mathematics of Operations Research, 28 (2003), 533. doi: 10.1287/moor.28.3.533.16395. Google Scholar
[20]	X. W. Liu and J. Sun, A robust primal-dual interior-point algorithm for nonlinear programs,, SIAM Journal on Optimization, 14 (2004), 1163. doi: 10.1137/S1052623402400641. Google Scholar
[21]	X. W. Liu and J. Sun, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions,, Journal of Optimization Theory and Applications, 125 (2005), 609. doi: 10.1007/s10957-005-2092-4. Google Scholar
[22]	Z. Q. Luo, J. S. Pang and D. Ralph, Mathematical Programs with Equilibrium Constraints,, Cambridge University Press, (1996). doi: 10.1017/CBO9780511983658. Google Scholar
[23]	K. W. Meng, S. J. Li and X. Q. Yang, A robust SQP method based on a smoothing lower order penalty functions,, Optimization, 58 (2009), 23. doi: 10.1080/02331930701761193. Google Scholar
[24]	K. W. Meng and X. Q. Yang, First- and second-order necessary conditions via exact penalty functions,, Journal of Optimization Theory and Applications, 165* (2015), 720. doi: 10.1007/s10957-014-0664-x. Google Scholar*
[25]	K. W. Meng and X. Q. Yang, Optimality conditions via exact penalty functions,, SIAM Journal on Optimization, 20 (2010), 3208. doi: 10.1137/090771016. Google Scholar
[26]	Z. Q. Meng, C. Y. Dang and X. Q. Yang, On the smoothing of the square-root exact penalty function for inequality constrained optimization,, Computational Optimization and Applications, 35 (2006), 375. doi: 10.1007/s10589-006-8720-6. Google Scholar
[27]	M. Mongeau and A. Sartenaer, Automatic decrease of the penalty parameter in exact penalty function methods,, European Journal of Operational Research, 83 (1995), 686. doi: 10.1016/0377-2217(93)E0339-Y. Google Scholar
[28]	A. S. Nemirovski and M. J. Todd, Interior-point methods for optimization,, Acta Numerica, 17 (2008), 191. doi: 10.1017/S0962492906370018. Google Scholar
[29]	J. Nocedal and S. J. Wright, Numerical Optimization,, Springer Verlag, (2006). Google Scholar
[30]	I. Pólik and T. Terlaky, Interior point methods for nonlinear optimization,, Nonlinear optimization, 1989* (2010), 215. doi: 10.1007/978-3-642-11339-0_4. Google Scholar*
[31]	R. T. Rockafellar and R. J. B. Wets, Variational Analysis,, Springer-Verlag, (1998). doi: 10.1007/978-3-642-02431-3. Google Scholar
[32]	A. M. Rubinov, B. M. Glover and X. Q. Yang, Decreasing functions with applications to penalization,, SIAM Journal on Optimization, 10 (1999), 289. doi: 10.1137/S1052623497326095. Google Scholar
[33]	D. F. Shanno and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods,, Mathematical Programming, 87 (2000), 303. doi: 10.1007/s101070050116. Google Scholar
[34]	G. Still and M. Streng, Optimality conditions in smooth nonlinear programming,, Journal of Optimization Theory and Applications, 90 (1996), 483. doi: 10.1007/BF02189792. Google Scholar
[35]	R. J. Vanderbei and D. F. Shanno, An interior-point algorithm for nonconvex nonlinear programming,, Computational Optimization and Applications, 13 (1999), 231. doi: 10.1023/A:1008677427361. Google Scholar
[36]	A. Wächter and L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,, Mathematical Programming, 106 (2006), 25. doi: 10.1007/s10107-004-0559-y. Google Scholar
[37]	S. J. Wright, Primal-dual Interior-Point Methods,, SIAM, (1987). doi: 10.1137/1.9781611971453. Google Scholar
[38]	Z. B. Xu, X. Y. Chang, F. M. Xu and H. Zhang, $L_{1/2}$ Regularization: A thresholding representation theory and a fast solver,, Neural Networks and Learning Systems, 23 (2012), 1013. Google Scholar
[39]	X. Q. Yang and Z. Q. Meng, Lagrange multipliers and calmness conditions of order $p$,, Mathematics of Operations Research, 32 (2007), 95. doi: 10.1287/moor.1060.0217. Google Scholar
[40]	X. Q. Yang, Z. Q. Meng, X. X. Huang and G. T. Y. Pong, Smoothing nonlinear penalty functions for constrained optimization problems,, Numerical Functional Analysis and Optimization, 24 (2003), 351. doi: 10.1081/NFA-120022928. Google Scholar
[41]	Y. Y. Ye, Interior Point Algorithms: Theory and Analysis,, Wiley-Interscience, (1997). doi: 10.1002/9781118032701. Google Scholar

[1]	Olena Naboka. On synchronization of oscillations of two coupled Berger plates with nonlinear interior damping. Communications on Pure & Applied Analysis, 2009, 8 (6) : 1933-1956. doi: 10.3934/cpaa.2009.8.1933
[2]	Deren Han, Zehui Jia, Yongzhong Song, David Z. W. Wang. An efficient projection method for nonlinear inverse problems with sparsity constraints. Inverse Problems & Imaging, 2016, 10 (3) : 689-709. doi: 10.3934/ipi.2016017
[3]	Xiaoming Wang. Quasi-periodic solutions for a class of second order differential equations with a nonlinear damping term. Discrete & Continuous Dynamical Systems - S, 2017, 10 (3) : 543-556. doi: 10.3934/dcdss.2017027
[4]	Ziteng Wang, Shu-Cherng Fang, Wenxun Xing. On constraint qualifications: Motivation, design and inter-relations. Journal of Industrial & Management Optimization, 2013, 9 (4) : 983-1001. doi: 10.3934/jimo.2013.9.983
[5]	Sara Munday. On the derivative of the $\alpha$-Farey-Minkowski function. Discrete & Continuous Dynamical Systems - A, 2014, 34 (2) : 709-732. doi: 10.3934/dcds.2014.34.709
[6]	Jean-François Biasse. Improvements in the computation of ideal class groups of imaginary quadratic number fields. Advances in Mathematics of Communications, 2010, 4 (2) : 141-154. doi: 10.3934/amc.2010.4.141
[7]	Marcelo Messias. Periodic perturbation of quadratic systems with two infinite heteroclinic cycles. Discrete & Continuous Dynamical Systems - A, 2012, 32 (5) : 1881-1899. doi: 10.3934/dcds.2012.32.1881
[8]	Ardeshir Ahmadi, Hamed Davari-Ardakani. A multistage stochastic programming framework for cardinality constrained portfolio optimization. Numerical Algebra, Control & Optimization, 2017, 7 (3) : 359-377. doi: 10.3934/naco.2017023
[9]	Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev. Linear programming solutions of periodic optimization problems: approximation of the optimal control. Journal of Industrial & Management Optimization, 2007, 3 (2) : 399-413. doi: 10.3934/jimo.2007.3.399
[10]	Caifang Wang, Tie Zhou. The order of convergence for Landweber Scheme with $\alpha,\beta$-rule. Inverse Problems & Imaging, 2012, 6 (1) : 133-146. doi: 10.3934/ipi.2012.6.133
[11]	Alexandre B. Simas, Fábio J. Valentim. $W$-Sobolev spaces: Higher order and regularity. Communications on Pure & Applied Analysis, 2015, 14 (2) : 597-607. doi: 10.3934/cpaa.2015.14.597
[12]	Ralf Hielscher, Michael Quellmalz. Reconstructing a function on the sphere from its means along vertical slices. Inverse Problems & Imaging, 2016, 10 (3) : 711-739. doi: 10.3934/ipi.2016018
[13]	Hyeong-Ohk Bae, Hyoungsuk So, Yeonghun Youn. Interior regularity to the steady incompressible shear thinning fluids with non-Standard growth. Networks & Heterogeneous Media, 2018, 13 (3) : 479-491. doi: 10.3934/nhm.2018021
[14]	Armin Lechleiter, Tobias Rienmüller. Factorization method for the inverse Stokes problem. Inverse Problems & Imaging, 2013, 7 (4) : 1271-1293. doi: 10.3934/ipi.2013.7.1271
[15]	Yanqin Fang, Jihui Zhang. Multiplicity of solutions for the nonlinear Schrödinger-Maxwell system. Communications on Pure & Applied Analysis, 2011, 10 (4) : 1267-1279. doi: 10.3934/cpaa.2011.10.1267
[16]	Charles Fulton, David Pearson, Steven Pruess. Characterization of the spectral density function for a one-sided tridiagonal Jacobi matrix operator. Conference Publications, 2013, 2013 (special) : 247-257. doi: 10.3934/proc.2013.2013.247
[17]	A. Aghajani, S. F. Mottaghi. Regularity of extremal solutions of semilinaer fourth-order elliptic problems with general nonlinearities. Communications on Pure & Applied Analysis, 2018, 17 (3) : 887-898. doi: 10.3934/cpaa.2018044
[18]	Qiang Guo, Dong Liang. An adaptive wavelet method and its analysis for parabolic equations. Numerical Algebra, Control & Optimization, 2013, 3 (2) : 327-345. doi: 10.3934/naco.2013.3.327
[19]	Irena PawŃow, Wojciech M. Zajączkowski. Global regular solutions to three-dimensional thermo-visco-elasticity with nonlinear temperature-dependent specific heat. Communications on Pure & Applied Analysis, 2017, 16 (4) : 1331-1372. doi: 10.3934/cpaa.2017065
[20]	Tao Wu, Yu Lei, Jiao Shi, Maoguo Gong. An evolutionary multiobjective method for low-rank and sparse matrix decomposition. Big Data & Information Analytics, 2017, 2 (1) : 23-37. doi: 10.3934/bdia.2017006

2019 Impact Factor: 1.366

American Institute of Mathematical Sciences

An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization

References:

References:

Tools

Metrics

Other articles
by authors

Tools

Metrics

Other articles
by authors

American Institute of Mathematical Sciences

An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization

References:

References:

Tools

Metrics

Other articlesby authors

Tools

Metrics

Other articlesby authors

Other articles
by authors

Other articles
by authors