A class of Smoothing Method for Linear Second-Order Cone Programming
|
|
- Anis Preston
- 6 years ago
- Views:
Transcription
1 Columbia International Publishing Journal of Advanced Computing (13) 1: 9-4 doi:1776/jac1313 Research Article A class of Smoothing Method for Linear Second-Order Cone Programming Zhuqing Gui *, Zhibin Zhu, and Huali Zhu Received 1 November 1; Published online 15 December 1 he author(s) 1 Published with open access at wwwusciporg Abstract Recently, there has been much interest in studying linear second-order cone programming his paper uses the Kanzow-Kleinmichel function for the second-order cone complementarity problem, so the Karush-Kuhn- ucer optimality condition of the primal problem is changed into a system of equations We can apply the Newton method to the system of equations hen, the algorithm is proved to be globally convergent and locally quadratically convergent Keywords: Second-order cone programming; Jordan algebra; Smoothing function; Global convergence; Local quadratic convergence 1 Introduction Second-order cone programming (SOCP) can be dated from the classic Fermat-Weber problem in 17th century It can be applied in a wider range of fields including combinatorial optimization, engineering, logistics and transportation Steiner minimum tree and facility location problems are extensively used in combinatorial optimization, logistics and transportation, respectively hey are the extension of the Fermat problem Xue and Ye (1997) showed that both of them can be transformed into SOCP problems, and the primal-dual interior point method can be applied to solve them Lebret (1995) and Andersen et al (1998) showed that antenna array constraint problems can be translated into SOCP problems, which can be solved by the interior point method Goldfarb and Iyenger (1997) introduced nondeterministic structure of maret parameters and showed the corresponding robust portfolio optimization problem of nondeterministic structure can be formulated as SOCP problems Hence, it can reduce the difficulty of calculation With the exception of these problems, SOCP can be applied *Corresponding guizhq_45@16com Department of Computational Science & Mathematics, Guilin University of Electronic echnology, 9 Guilin, 5414, P R China
2 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 in many other fields, such as image restoration problems, robust problems and grasping force optimization problems he standard form of the linear SOCP problem is given by (P) min c x s t Ax b, x K, multi-class classification (11) Where A ( A1, A,, A r ), the second-order cone: mn j n Aj R, c j j R, j 1,,, r, b R m, x j j K, j 1,,, r K j n j 1 K { x ( x ; x) R R x x }, j where refers to the standard Euclidean norm, n is the dimension of K j j For the cone K, let bd K { x K x x, x }, denote the boundary of K Also, let int K { x K x x } denote the interior of K Set n n1 n nr, K K 1 K K r he dual problem of the primal problem (11) is given by (D) max Τ b y s t A y z c z K,, (1) m where z j K j, j = 1,,, r is the slac variable, and y R, z = (z 1,, z r ) K Jordan algebra is associated with LP, SDP and SOCP Faraut and Korany (1994) constructed the theory It is well nown that complementarity conditions play an important role in the KK conditions, and the complementarity function is the ey to solve the complementarity problem Obviously, the definition of the complementarity function for linear or nonlinear complementarity problems (LCP/NCP) is completely different from the one for second-order cone complementarity problems (SOCCP), because the latter is a vector-valued function By means of the Jordan-algebra technique, Fuushima et al (1) extended several smoothing complementarity functions to the setting of SOCCP and studied differential and Lipschitzian properties of them Motivated by their wor, Liu et al (7) and Chi and Liu (9) extended the Chen-Harer-Kanzow-Smale (CHKS) smoothing function and the Fischer-Burmeister (FB) function to the setting of SOCCP, respectively In this paper, firstly, we give the KK optimality condition for the problem (11) With the help of the Jordan algebra technique we introduce the Kanzow-Kleinmichel function for SOCCP, and show that it is continuously differentiable everywhere he smoothing function includes a parameter, and the smoothing function changes over the different When =, it is an F-B function; when =-, it is a CHKS function hen, the KK optimality condition is transformed into a system of equations We can apply the Newton method to the system of equations In order to guarantee fast convergence of the algorithm, we introduce the central path, which made every iteration 3
3 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 descended sufficiently in the Newton direction, and the iterative point does not go beyond the central area Hence, the algorithm is globally convergent and locally quadratically convergent Preliminaries 1 Jordan Algebra For any given p=( p ; p) R R and q=( q; q) R R,we define the following multiplication: p q=( p q; p q+ q p) he vector =(1;) R R is the unique identity element of K For any vector x R, the arrow matrix is defined as: x Arw( x)= x x xi Obviously, Arw( x ) is symmetric positive definite if and only if it holds that x K It is easily verified that Arw( x)= x s, s R Next, we introduce the spectral factorization of vectors in Let x=( x ; x) R R, then it can be decomposed as: R associated with K x= u + u, 1 1 where = +() i i x x, i=1, are the spectral values, and 1 (1;() i x ), if x, x u i = 1 (1;() i v), if x =, (1) are the spectral vectors of x, where v is a vector on R with v =1 When x K, the spectral values of x are nonnegative, so, we can define x= u + u, 1 1 x = 1u1 + u Central Path he primal-dual problems (11) and (1) are equivalent to the following KK optimality condition: 31
4 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 Ax b, A y z c, x z, x K, z K, () A parameter > is introduced to give the following disturbance of the optimality condition () Ax b, A y z c, x z e, i=1,,, r, i i i x K, z K, i i i i (3) where =(1;) R R n i i he trajectory of points ( x, y, z) satisfying (3) for > is called the central path We introduce the following smoothing function: ( p, q, )= p+ q- p + q + p q+(- ) [-,) (4) Clearly, there are several interesting properties of function ( p, q, ) PROPOSIION 1 1) ( p, q, )= if and only if p K, q K and p q= ) Let >, ( p, q, )= if and only if p int K, q int K and p q= 3) For ang p, q R and ang > >,we have - ( - ) ( p, q, )- ( p, q, ), - ( p, q, )- ( p, q, ) K K (5) LEMMA Let t = p + q + p q, ( p, q, )= p+ q- ( t, ) is continuously differentiable, and the gradient is ( t, )= t +(- ), then the smoothing function I -( Arw( p)+ Arw( q)) Arw( t) ( p, q, )= I -( Arw( q)+ Arw( p)) Arw( t) - ( t, ) (6) Proof Since the vector t can be decomposed as t= c + c, 1 1 3
5 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 where 1, and c1, c are the spectral values and the associated spectral vectors of t, we have ( t, ) = +(- ) c + +(- ) c 1 1 According to Lemma 1 (Kanzow and Kleinmichel, 1998), we get that (- ) +(- ) [ +(- ) ] [ +(- ) ] (- ) (- ) ( t, ) = c + c = c + c From Lemma 5 (Alizadel and Goldfarb, 3), it is easy to now that p q ( p, q, ) = I-( Arw( p)+ Arw( q)) Arw( t), ( p, q, ) = I-( Arw( q)+ Arw( p)) Arw( t) he conclusion holds 3 Algorithm and Properties he vectors x, z can be partitioned as follows: x x1 x r = (,, ), z = ( z1,, z r ), ni where x, z R, i = 1,, r, so ( x, z, ) can also be partitioned as i i ( x, z, ) = ( ( x, z, ); ; ( x, z, )) x r r r n m n m n n For the mapping F : R R R R R R, we denote Ax-b F ( x, y, z) = A y+ z-c ( x, z, ) (31) It is easy to now that, when >, ( x, y, z ) satisfies the central path if and only if ( x, y, z ) is the solution of the nonlinear equations F ( x, y, z) = In particular, if =,it is the solution of the optimality condition () Obviously, when, the smoothness of the function F is affected In this paper, we viewed the parameter as a variable to overcome the influence n m n m n n Let F : R R R R R R R R, we define 33
6 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 F( x, y, z, ) = Ax-b A y+ z-c, (3) ( x, z, ) e where e is the base of natural logarithms, then function F( x, y, z, ) = is equivalent to the optimality condition () Now we can define neighborhoods around the central path N( ) = ( x, y, z, ) Ax b, A y+ z= c, ( x, z, ) We ensure that and the iteration point can be landed in the field in every iteration Now, the algorithm for the solution of the problem (3) can be stated as follows Algorithm A Step Initialization and date: Given a starting point u with Ax b, A y + z = c, > Set such that Choose (, 1), >, > Set = ( x, z, ) Step 1 Estimates step: Solve the following linear system F( x, y, z, ) ( x ; y ; z ; ) = - F( x, y, z, ) (33) We get the solution ( x ; y ; z ; ) If ( x + x, z + z, ) =, SOP! Otherwise, if ( x + x, z + z, ), set (, x y, z ) = ( x, y, z ), =, =1, h or set =, h is the integer that satisfies the following inequality i i ( x + x, z + z, ), i = 1,, h, (34) ( x + x, z + z, ) > h+1 h+1 34
7 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 Let =, and ( x, y, z ), if h=, ( x, y, z ) = ( +, +, + x x y y z z ), if h> Step Correction step: Let ( x ; y ; z ; ) be a solution of the following linear system (,,, ) ( ; ; ; )= - (,,, ) + [; (1- )e F x y z x y z F x y z ] (35) Step 3 he linear search: Set =max i i=, 1,,, which satisfies the following inequality ( x + x, z + z, + ) (1- ) (36) Step 4 Update: Let ( x, y, z ) = ( x +, + x y y, z + z ), +1= (1- ) and = +1 Go bac to step 1 H 31 he matrix A has full row ran he next theorem is given to ensure that equations (33) and (34) are consistent HEOREM 31 he smoothing function F is continuously differentiable in R n + m+1 If the condition H n m n 31 holds, then the Jacobian of F given by (3) is invertible for all ( x, y, z, ) R R R R Proof he Jacobian of F is given by F( x, y, z, ) = A A I, (37) ' H ( x) G( x) - e 35
8 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 where H x x z I Arw w Arw x Arw z G x x z I Arw w Arw z Arw x ( )= x(,, ) - ( ) ( ( )+ ( )), ( )= z(,, ) = - ( ) ( ( )+ ( )), w x x z = +z + ( )+(- ), [-,), ' - =- ( x, z, ) he matrix F( x, y, z, ) is invertible if and only if the linear system F( x, y, z, ) ( x; y; z; ) =, or, equivalently, Ax (38) A y+ z = (39) ' H ( x) x + G( x) z- = (31) e = (311) has the only zero solution As e, we obtain from (311) So (31) is equivalent to H ( x) x + G( x) z =, (31) namely, [ I- Arw( w) ( Arw( x)+ Arw( z))] x + [ I - Arw( w) ( Arw( z)+ Arw( x))] z = he last equation is multiplied by Arw( w ), and we can get [ Arw( w)-( Arw( x)+ Arw( z))] x + [ Arw( w)-( Arw( z)+ Arw( x))] z = Since Arw( w)-( Arw( z)+ Arw( x)), we multiply the formula by 36
9 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: x [ Arw( w)-( Arw( z)+ Arw( x))], and gain that 1 x [ Arw( w)-( Arw( z)+ Arw( x))] [ Arw( w)-( Arw( x)+ Arw( z))] x x z By (38) and (39), we receive that x z, so the above equation is equivalent to 1 x [ Arw( w)-( Arw( z)+ Arw( x))] [ Arw( w)-( Arw( x)+ Arw( z))] x Setting 1 g = [ Arw( w)-( Arw( z)+ Arw( x))] x, we have g [ Arw( w)-( Arw( x)+ Arw( z))][ Arw( w)-( Arw( z)+ Arw( x))] g = Due to the fact that [ Arw( w)-( Arw( x)+ Arw( z))][ Arw( w)-( Arw( z)+ Arw( x))], we obtain g = hen, x = [ Arw( w)-( Arw( z)+ Arw( x))] g = From (31), we obtain z = Since the matrix A has full row ran, then y = Given all that, the equation F( x, y, z, ) ( x; y; z; ) = has the only solution ( x; y; z; ) =, so F( x, y, z, ) is invertible his completes the proof HEOREM 3 Suppose that H31 holds, then the Algorithm A is well-defined, and all the iterations fall in the field N( ) Proof Firstly, we consider Step 1 Since ( x, y, z) is continuously differentiable, the inner loops can be terminated in a finite number of iterations herefore, Step 1 is well-defined, and (, x y, z, ) satisfies the condition of field, ie ( x, y, z, ) N( ) 37
10 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 We suppose that the calculation of cannot be stopped in a finite number of iterations in Step 3 hen for any t N, we have ( +, +, + x x z z ) >(1- ) >(1- ) ( x, z, ) namely, ( +, +, + )- (, x x z z, ) > - (, x z x z, ) Set t, we have - ( x, z, ) >- ( x, z, ) Since (, 1), this shows that ( x, z, ) = Hence, we obtain t lim ( + t, +, t x x z z + t ) =, lim(1- ) = t t Obviously, this is contradictory with the assumptions, so Step is well-defined From the update rule, we have (,, x y z, ) N( ), ( x, y, z, ) N( ) 4 he Convergence of the Algorithm In this section, we will show the global and locally quadratic convergence of the Algorithm A HEOREM 41 If ( x, y, z) is an accumulation point of sequence( x, y, z ) generated by the Algorithm A, then lim = Proof By the criterion of the Algorithm A, the sequence is monotone decreasing and with bounded below herefore, is said to be convergent to a nonnegative constant We prove = by contradiction Assume that > holds By the iterative rule of the Algorithm A, for all sufficiently large, we have (, x y, z )=( x, y, z ), =, = 1 (41) 38
11 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 hen, considering the iterative rule in Step, we have = (1- i ) i=1 Since >, one has lim = By the linear search criterion (36), we now that not satisfy (36) for all N sufficiently large Consequently, we obtain = does lim ( x + x, z + z, + ) > (1- ) (4) t Assume ( x, y, z) is the accumulation point of sequence( x, y, z ) Suppose sequence ( x, y, z ) ( x, y, z) Since >, the sequence ( x, y, z, ) ( x, y, z, ), and ( x, y, z, ) is the solution of the following linear systems F( x, y, z, ) ( x, y, z, ) = - F( x, y, z, ) [; (1 ) e ] Since, from (4), we obtain that ( x, y, z) (43) In addition, combining with (41) and (4), for any large enough N, we have ( x + x, z + z, + ) > (1- ) =(1- ) >(1- ) ( x, z, ) By the above expression, we have ( +, +, + x x z z ) - ( x, z, ) - ( x, z, ) Setting, it holds that - ( x, z, ) - ( x, z, ) 39
12 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 Since (,1), then ( x, z, ) = According to (43), we obtain = he proof is finished HEOROM 4 Each accumulation of the sequence ( x, y, z ) generated by the Algorithm A is the solution of the optimality condition () Proof Assume ( x, y, z) is an accumulation of( x, y, z ), and( x, y, z ) ( x, y, z) It follows from heorem 41 that lim = Since ( x, y, z ) N( ), then we have ( x, z, ) = lim ( x, y, ) lim = L L From Proposition 1, we now that ( x, y, z) is the solution of the optimality condition() herefore, the result holds In what follows, we discuss the locally quadratic convergence of the Algorithm A It needs the following condition H 41 Assume the solution of optimality condition () satisfies the condition of primal and dual nondegeneracy and strict complementarity H 4 For the sequence ( x, y, z ) generated by the Algorithm A, it has one or more accumulations, moreover ( x, y, z, ) = O( ) L Holds, where ( x, y, z, ) is given by linear search (33) PROPOSIION 43 Suppose H41 holds, then H4 is correct Proof If H41 holds, F is nonsingular, Furthermore, lim[ F( x, y, z, ) ] 1 is bounded From the transformation of (33), we obtain ( ; ; ; ) = - (,,, )( (,,, ) ) 1 x y z F x y z F x y z Apparently, it is sufficient to prove F( x, y, z, ) = O( ) In fact, we have 4
13 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 F( x, y, z, ) ( x, z, ) +(e ) ( x, z, ) +(e ) + + o( ) = O( ) Hence, ( x, y, z, ) = O( ) holds he claim holds HEOREM 44 Suppose that H4 holds and > - Let be Lipschitz continuous in the field of ( x, z, ), then for any sufficiently large, we have +1 = O( ) Proof We first prove ( x + x, z + z, ) = O( ) Using (33), it implies enough, we have Since is locally Lipschitz continuous for any large - = e = - ( x + x, z + z, ) = ( x + x, z + z, + ) = ( x + x, z + z, + )- ( x, z, )- ( x, z, )( x ; z ; ) O( ( x ; z ; ) ) = O( ) From (34) we now, for any sufficiently large, that < ( x + x, z + z, ) ( x + x, z + z, ) + ( x + x, z + z, ) ( x + x, z + z, ) ( x + x, z + z, ) + - herefore, we have ( - - ) ( x + x, z + z, ), hence = O( ) Using the Algorithm A and the definition of +1 and, we obtain O +1= (1- ) = (1- ) = ( ) he proof is finished 41
14 Zhuqing Gui, Zhibin Zhu, and Huali Zhu / Journal of Advanced Computing (13) 1: 9-4 Acnowledgement his wor was supported in part by NNSF (No116111) of China, Guangxi Fund for Distinguished Young Scholars (1GXNSFFA63) and Innovative project of Guangxi graduate education ( M6) References Alizadeh, F, Goldfarb, D,3 Second-order cone programming Mathematical Programming Math Program Ser B 95, Andersen, K D, Christiansen, E Overton, M L, 1998 Limit Analysis by Minimizing a Sum of Norms SIAM J Scientific Computing, 19(3), Chen, X D, Sun, D F, Sun, J, 3 Comlementarity funtions and numerical experiments on smoothing Newton methods for second-order-cone complementarity problems Computational Optimization and Applications 5(1-3), Chi, X N, Liu, S Y, 9 A predictop-corrector smoothing method for second order cone programming Journal of System Science and Mathematical Science 9(4), Faraut U, Koranyi, A, 1994 Analysis on Symmetric Cone Oxford Mathematical Monographs, New Yor, Oxford University Press Fuushima, M, Luo, Z Q, seng, P, 1 Smoothing funtion for second-order-cone complementarity problems SIAM Journal on Optimization 1(), Kanzow, C, Kleinmichel, H, 1998 A new class of semismooth Newton method for nonlinear complementarity problems Computational Optimization and Applications 1, Lebret, H, 1995 Antenna pattern synthesis throuhg convex optimization Proceedings of the SPIE Advanced Siginal Processing Algorithms 189 Lebret, H, Boyd, S, 1997 Antenna array Pattern Synthesis via convex optimization SIAM J Matrix Anal APPL 45(3), Liu, Y J, Zhang L W, Wang, Y H, 7 Convergence Properties of a Smoothing Method for Linear Secondorder Cone Programming Advances in Mathematics, 36(4), Sun, D, F, Sun, J, 5 Strong semismoothness of Fischer-Burmeister SDC and SOC complementarity functions Mathematical programming 13(3), Xue, G, Ye, Y Y, 1997 An efficient algorithm for minimizing a sum of Euclidean norms with application SIAM Journal on Optimization 7, Yuan, Y X, Sun, W Y, 1997 Optimization theory and methods Beijing, Science Press 4
A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems
A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems Xiaoni Chi Guilin University of Electronic Technology School of Math & Comput Science Guilin Guangxi 541004 CHINA chixiaoni@126.com
More informationA smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
Volume 30, N. 3, pp. 569 588, 2011 Copyright 2011 SBMAC ISSN 0101-8205 www.scielo.br/cam A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationApplying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone
Applying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone Xin-He Miao 1, Nuo Qi 2, B. Saheya 3 and Jein-Shan Chen 4 Abstract: In this
More informationThe Q Method for Symmetric Cone Programmin
The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programmin Farid Alizadeh and Yu Xia alizadeh@rutcor.rutgers.edu, xiay@optlab.mcma Large Scale Nonlinear and Semidefinite Progra
More informationError bounds for symmetric cone complementarity problems
to appear in Numerical Algebra, Control and Optimization, 014 Error bounds for symmetric cone complementarity problems Xin-He Miao 1 Department of Mathematics School of Science Tianjin University Tianjin
More informationFischer-Burmeister Complementarity Function on Euclidean Jordan Algebras
Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras Lingchen Kong, Levent Tunçel, and Naihua Xiu 3 (November 6, 7; Revised December, 7) Abstract Recently, Gowda et al. [] established
More informationDepartment of Social Systems and Management. Discussion Paper Series
Department of Social Systems and Management Discussion Paper Series No. 1262 Complementarity Problems over Symmetric Cones: A Survey of Recent Developments in Several Aspects by Akiko YOSHISE July 2010
More informationA Smoothing SQP Method for Mathematical Programs with Linear Second-Order Cone Complementarity Constraints
A Smoothing SQP Method for Mathematical Programs with Linear Second-Order Cone Complementarity Constraints Hiroshi Yamamura, Taayui Ouno, Shunsue Hayashi and Masao Fuushima June 14, 212 Abstract In this
More informationA Smoothing Newton Method for Solving Absolute Value Equations
A Smoothing Newton Method for Solving Absolute Value Equations Xiaoqin Jiang Department of public basic, Wuhan Yangtze Business University, Wuhan 430065, P.R. China 392875220@qq.com Abstract: In this paper,
More informationA new ane scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints
Journal of Computational and Applied Mathematics 161 (003) 1 5 www.elsevier.com/locate/cam A new ane scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality
More informationNewton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions
260 Journal of Advances in Applied Mathematics, Vol. 1, No. 4, October 2016 https://dx.doi.org/10.22606/jaam.2016.14006 Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum
More informationPrimal-dual path-following algorithms for circular programming
Primal-dual path-following algorithms for circular programming Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan July, 015 Abstract Circular programming problems are a
More informationA derivative-free nonmonotone line search and its application to the spectral residual method
IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral
More informationSpectral gradient projection method for solving nonlinear monotone equations
Journal of Computational and Applied Mathematics 196 (2006) 478 484 www.elsevier.com/locate/cam Spectral gradient projection method for solving nonlinear monotone equations Li Zhang, Weijun Zhou Department
More informationAffine scaling interior Levenberg-Marquardt method for KKT systems. C S:Levenberg-Marquardt{)KKTXÚ
2013c6 $ Ê Æ Æ 117ò 12Ï June, 2013 Operations Research Transactions Vol.17 No.2 Affine scaling interior Levenberg-Marquardt method for KKT systems WANG Yunjuan 1, ZHU Detong 2 Abstract We develop and analyze
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 41 (2015), No. 5, pp. 1259 1269. Title: A uniform approximation method to solve absolute value equation
More informationUsing Schur Complement Theorem to prove convexity of some SOC-functions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan
More informationA Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems
A Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems Wei Ma Zheng-Jian Bai September 18, 2012 Abstract In this paper, we give a regularized directional derivative-based
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationAN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING
AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING XIAO WANG AND HONGCHAO ZHANG Abstract. In this paper, we propose an Augmented Lagrangian Affine Scaling (ALAS) algorithm for general
More informationManual of ReSNA. matlab software for mixed nonlinear second-order cone complementarity problems based on Regularized Smoothing Newton Algorithm
Manual of ReSNA matlab software for mixed nonlinear second-order cone complementarity problems based on Regularized Smoothing Newton Algorithm Shunsuke Hayashi September 4, 2013 1 Introduction ReSNA (Regularized
More informationA double projection method for solving variational inequalities without monotonicity
A double projection method for solving variational inequalities without monotonicity Minglu Ye Yiran He Accepted by Computational Optimization and Applications, DOI: 10.1007/s10589-014-9659-7,Apr 05, 2014
More informationA Generalized Homogeneous and Self-Dual Algorithm. for Linear Programming. February 1994 (revised December 1994)
A Generalized Homogeneous and Self-Dual Algorithm for Linear Programming Xiaojie Xu Yinyu Ye y February 994 (revised December 994) Abstract: A generalized homogeneous and self-dual (HSD) infeasible-interior-point
More informationThe Q Method for Second-Order Cone Programming
The Q Method for Second-Order Cone Programming Yu Xia Farid Alizadeh July 5, 005 Key words. Second-order cone programming, infeasible interior point method, the Q method Abstract We develop the Q method
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationTwo unconstrained optimization approaches for the Euclidean κ-centrum location problem
Noname manuscript No (will be inserted by the editor) Shaohua Pan and Jein-Shan Chen Two unconstrained optimization approaches for the Euclidean κ-centrum location problem Abstract Consider the single-facility
More informationOn the Coerciveness of Merit Functions for the Second-Order Cone Complementarity Problem
On the Coerciveness of Merit Functions for the Second-Order Cone Complementarity Problem Guidance Professor Assistant Professor Masao Fukushima Nobuo Yamashita Shunsuke Hayashi 000 Graduate Course in Department
More informationA QP-FREE CONSTRAINED NEWTON-TYPE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS. Christian Kanzow 1 and Hou-Duo Qi 2
A QP-FREE CONSTRAINED NEWTON-TYPE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS Christian Kanzow 1 and Hou-Duo Qi 2 1 University of Hamburg Institute of Applied Mathematics Bundesstrasse 55, D-20146 Hamburg,
More informationON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS
ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS A. F. Izmailov and A. S. Kurennoy December 011 ABSTRACT In the context of mixed complementarity problems various concepts of solution regularity are
More informationThe Jordan Algebraic Structure of the Circular Cone
The Jordan Algebraic Structure of the Circular Cone Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan Abstract In this paper, we study and analyze the algebraic structure
More informationA SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES
A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES Francisco Facchinei 1, Andreas Fischer 2, Christian Kanzow 3, and Ji-Ming Peng 4 1 Università di Roma
More information20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes
016 0 J.-S. CHEN, C.-H. KO AND X.-R. WU whereas the natural residual function ϕ : R R is given by ϕ (a, b) = a (a b) + = min{a, b}. Recently, the generalized Fischer-Burmeister function ϕ p : R R, which
More informationFinite Convergence for Feasible Solution Sequence of Variational Inequality Problems
Mathematical and Computational Applications Article Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Wenling Zhao *, Ruyu Wang and Hongxiang Zhang School of Science,
More informationLecture: Algorithms for LP, SOCP and SDP
1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
More informationA Second-Order Path-Following Algorithm for Unconstrained Convex Optimization
A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization Yinyu Ye Department is Management Science & Engineering and Institute of Computational & Mathematical Engineering Stanford
More informationPrimal-Dual Interior-Point Methods for Linear Programming based on Newton s Method
Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach
More informationResearch Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We
More informationA projection-type method for generalized variational inequalities with dual solutions
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 4812 4821 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa A projection-type method
More informationIterative common solutions of fixed point and variational inequality problems
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (2016), 1882 1890 Research Article Iterative common solutions of fixed point and variational inequality problems Yunpeng Zhang a, Qing Yuan b,
More informationGENERALIZED second-order cone complementarity
Stochastic Generalized Complementarity Problems in Second-Order Cone: Box-Constrained Minimization Reformulation and Solving Methods Mei-Ju Luo and Yan Zhang Abstract In this paper, we reformulate the
More informationWHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?
WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS? Francisco Facchinei a,1 and Christian Kanzow b a Università di Roma La Sapienza Dipartimento di Informatica e
More informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
More informationPermutation invariant proper polyhedral cones and their Lyapunov rank
Permutation invariant proper polyhedral cones and their Lyapunov rank Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu
More informationSecond-Order Cone Programming
Second-Order Cone Programming F. Alizadeh D. Goldfarb 1 Introduction Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection
More informationKey words. linear complementarity problem, non-interior-point algorithm, Tikhonov regularization, P 0 matrix, regularized central path
A GLOBALLY AND LOCALLY SUPERLINEARLY CONVERGENT NON-INTERIOR-POINT ALGORITHM FOR P 0 LCPS YUN-BIN ZHAO AND DUAN LI Abstract Based on the concept of the regularized central path, a new non-interior-point
More informationResearch Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
Mathematical Problems in Engineering Volume 2010, Article ID 346965, 12 pages doi:10.1155/2010/346965 Research Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
More informationLecture 8 Plus properties, merit functions and gap functions. September 28, 2008
Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:
More informationSOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction
ACTA MATHEMATICA VIETNAMICA 271 Volume 29, Number 3, 2004, pp. 271-280 SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM NGUYEN NANG TAM Abstract. This paper establishes two theorems
More informationA Continuation Approach Using NCP Function for Solving Max-Cut Problem
A Continuation Approach Using NCP Function for Solving Max-Cut Problem Xu Fengmin Xu Chengxian Ren Jiuquan Abstract A continuous approach using NCP function for approximating the solution of the max-cut
More informationAn Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well
More informationA continuation method for nonlinear complementarity problems over symmetric cone
A continuation method for nonlinear complementarity problems over symmetric cone CHEK BENG CHUA AND PENG YI Abstract. In this paper, we introduce a new P -type condition for nonlinear functions defined
More informationA PENALIZED FISCHER-BURMEISTER NCP-FUNCTION. September 1997 (revised May 1998 and March 1999)
A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION Bintong Chen 1 Xiaojun Chen 2 Christian Kanzow 3 September 1997 revised May 1998 and March 1999 Abstract: We introduce a new NCP-function in order to reformulate
More informationStep lengths in BFGS method for monotone gradients
Noname manuscript No. (will be inserted by the editor) Step lengths in BFGS method for monotone gradients Yunda Dong Received: date / Accepted: date Abstract In this paper, we consider how to directly
More informationSecond-Order Cone Program (SOCP) Detection and Transformation Algorithms for Optimization Software
and Second-Order Cone Program () and Algorithms for Optimization Software Jared Erickson JaredErickson2012@u.northwestern.edu Robert 4er@northwestern.edu Northwestern University INFORMS Annual Meeting,
More informationKey words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationA new primal-dual path-following method for convex quadratic programming
Volume 5, N., pp. 97 0, 006 Copyright 006 SBMAC ISSN 00-805 www.scielo.br/cam A new primal-dual path-following method for convex quadratic programming MOHAMED ACHACHE Département de Mathématiques, Faculté
More informationFixed points of the derivative and k-th power of solutions of complex linear differential equations in the unit disc
Electronic Journal of Qualitative Theory of Differential Equations 2009, No. 48, -9; http://www.math.u-szeged.hu/ejqtde/ Fixed points of the derivative and -th power of solutions of complex linear differential
More informationXin-He Miao 2 Department of Mathematics Tianjin University, China Tianjin , China
Pacific Journal of Optimization, vol. 14, no. 3, pp. 399-419, 018 From symmetric cone optimization to nonsymmetric cone optimization: Spectral decomposition, nonsmooth analysis, and projections onto nonsymmetric
More informationA SUFFICIENTLY EXACT INEXACT NEWTON STEP BASED ON REUSING MATRIX INFORMATION
A SUFFICIENTLY EXACT INEXACT NEWTON STEP BASED ON REUSING MATRIX INFORMATION Anders FORSGREN Technical Report TRITA-MAT-2009-OS7 Department of Mathematics Royal Institute of Technology November 2009 Abstract
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationA globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications Weijun Zhou 28 October 20 Abstract A hybrid HS and PRP type conjugate gradient method for smooth
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
More informationFollowing The Central Trajectory Using The Monomial Method Rather Than Newton's Method
Following The Central Trajectory Using The Monomial Method Rather Than Newton's Method Yi-Chih Hsieh and Dennis L. Bricer Department of Industrial Engineering The University of Iowa Iowa City, IA 52242
More informationAn interior-point gradient method for large-scale totally nonnegative least squares problems
An interior-point gradient method for large-scale totally nonnegative least squares problems Michael Merritt and Yin Zhang Technical Report TR04-08 Department of Computational and Applied Mathematics Rice
More informationAN EIGENVALUE STUDY ON THE SUFFICIENT DESCENT PROPERTY OF A MODIFIED POLAK-RIBIÈRE-POLYAK CONJUGATE GRADIENT METHOD S.
Bull. Iranian Math. Soc. Vol. 40 (2014), No. 1, pp. 235 242 Online ISSN: 1735-8515 AN EIGENVALUE STUDY ON THE SUFFICIENT DESCENT PROPERTY OF A MODIFIED POLAK-RIBIÈRE-POLYAK CONJUGATE GRADIENT METHOD S.
More informationLecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.
MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.
More informationLecture: Introduction to LP, SDP and SOCP
Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:
More informationSemismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones
to appear in Linear and Nonlinear Analysis, 2014 Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones Jein-Shan Chen 1 Department of Mathematics National
More informationAn improved generalized Newton method for absolute value equations
DOI 10.1186/s40064-016-2720-5 RESEARCH Open Access An improved generalized Newton method for absolute value equations Jingmei Feng 1,2* and Sanyang Liu 1 *Correspondence: fengjingmeilq@hotmail.com 1 School
More informationNew hybrid conjugate gradient methods with the generalized Wolfe line search
Xu and Kong SpringerPlus (016)5:881 DOI 10.1186/s40064-016-5-9 METHODOLOGY New hybrid conjugate gradient methods with the generalized Wolfe line search Open Access Xiao Xu * and Fan yu Kong *Correspondence:
More informationIntroduction to Optimization Techniques. Nonlinear Optimization in Function Spaces
Introduction to Optimization Techniques Nonlinear Optimization in Function Spaces X : T : Gateaux and Fréchet Differentials Gateaux and Fréchet Differentials a vector space, Y : a normed space transformation
More informationSequential Quadratic Programming Method for Nonlinear Second-Order Cone Programming Problems. Hirokazu KATO
Sequential Quadratic Programming Method for Nonlinear Second-Order Cone Programming Problems Guidance Professor Masao FUKUSHIMA Hirokazu KATO 2004 Graduate Course in Department of Applied Mathematics and
More informationON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS
MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 677 692 Printed in U.S.A. ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS ALEXANDER SHAPIRO We discuss in this paper a class of nonsmooth
More informationPrimal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization Roger Behling a, Clovis Gonzaga b and Gabriel Haeser c March 21, 2013 a Department
More informationFixed point theorems of nondecreasing order-ćirić-lipschitz mappings in normed vector spaces without normalities of cones
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 18 26 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa Fixed point theorems of nondecreasing
More informationEXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE
Linear and Nonlinear Analysis Volume 3, Number 3, 07, 367 384 EXAMPLES OF r-convex FUNCTIONS AND CHARACTERIZATIONS OF r-convex FUNCTIONS ASSOCIATED WITH SECOND-ORDER CONE CHIEN-HAO HUANG, HONG-LIN HUANG,
More informationAn unconstrained smooth minimization reformulation of the second-order cone complementarity problem
Math. Program., Ser. B 104, 93 37 005 Digital Object Identifier DOI 10.1007/s10107-005-0617-0 Jein-Shan Chen Paul Tseng An unconstrained smooth minimization reformulation of the second-order cone complementarity
More informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationHandout 8: Dealing with Data Uncertainty
MFE 5100: Optimization 2015 16 First Term Handout 8: Dealing with Data Uncertainty Instructor: Anthony Man Cho So December 1, 2015 1 Introduction Conic linear programming CLP, and in particular, semidefinite
More informationSEMILINEAR ELLIPTIC EQUATIONS WITH DEPENDENCE ON THE GRADIENT
Electronic Journal of Differential Equations, Vol. 2012 (2012), No. 139, pp. 1 9. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu SEMILINEAR ELLIPTIC
More informationThe Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces
Applied Mathematical Sciences, Vol. 11, 2017, no. 12, 549-560 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.718 The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive
More informationResearch Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
Journal of Applied Mathematics Volume 2012, Article ID 219478, 15 pages doi:10.1155/2012/219478 Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity
More informationOn Solving SOCPs with an Interior-Point Method for NLP
On Solving SOCPs with an Interior-Point Method for NLP Robert Vanderbei and Hande Y. Benson INFORMS Nov 5, 2001 Miami Beach, FL Operations Research and Financial Engineering, Princeton University http://www.princeton.edu/
More informationA Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions
The First International Symposium on Optimization and Systems Biology (OSB 07) Beijing, China, August 8 10, 2007 Copyright 2007 ORSC & APORC pp. 405 411 A Trust Region Algorithm Model With Radius Bounded
More informationInterior-Point Methods for Linear Optimization
Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function
More informationNonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
Journal of Computational and Applied Mathematics 155 (2003) 285 305 www.elsevier.com/locate/cam Nonmonotonic bac-tracing trust region interior point algorithm for linear constrained optimization Detong
More informationAn accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 0 (207), 4822 4833 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa An accelerated Newton method
More informationOn the simplest expression of the perturbed Moore Penrose metric generalized inverse
Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated
More informationOn nonexpansive and accretive operators in Banach spaces
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 3437 3446 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa On nonexpansive and accretive
More informationA full-newton step infeasible interior-point algorithm for linear programming based on a kernel function
A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function Zhongyi Liu, Wenyu Sun Abstract This paper proposes an infeasible interior-point algorithm with
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationSTRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 45 (2009), 147 158 STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS Xiaolong Qin 1, Shin Min Kang 1, Yongfu Su 2,
More informationA sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
Volume 31, N. 1, pp. 205 218, 2012 Copyright 2012 SBMAC ISSN 0101-8205 / ISSN 1807-0302 (Online) www.scielo.br/cam A sensitivity result for quadratic semidefinite programs with an application to a sequential
More informationAn interior-point trust-region polynomial algorithm for convex programming
An interior-point trust-region polynomial algorithm for convex programming Ye LU and Ya-xiang YUAN Abstract. An interior-point trust-region algorithm is proposed for minimization of a convex quadratic
More information1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is
New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,
More informationOn the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities
J Optim Theory Appl 208) 76:399 409 https://doi.org/0.007/s0957-07-24-0 On the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities Phan Tu Vuong Received:
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationOptimization Tutorial 1. Basic Gradient Descent
E0 270 Machine Learning Jan 16, 2015 Optimization Tutorial 1 Basic Gradient Descent Lecture by Harikrishna Narasimhan Note: This tutorial shall assume background in elementary calculus and linear algebra.
More information