skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming

Publication Date:
Research Org.:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org.:
USDOE Office of Science - Office of Advanced Scientific Computing Research
OSTI Identifier:
DOE Contract Number:
Resource Type:
Journal Article
Resource Relation:
Journal Name: SIAM Journal on Optimization; Journal Volume: 25; Journal Issue: 3
Country of Publication:
United States
Conically constrained quadratic program; projected gradient method

Citation Formats

Goldberg, Noam, and Leyffer, Sven. An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming. United States: N. p., 2015. Web. doi:10.1137/140958025.
Goldberg, Noam, & Leyffer, Sven. An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming. United States. doi:10.1137/140958025.
Goldberg, Noam, and Leyffer, Sven. 2015. "An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming". United States. doi:10.1137/140958025.
title = {An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming},
author = {Goldberg, Noam and Leyffer, Sven},
abstractNote = {},
doi = {10.1137/140958025},
journal = {SIAM Journal on Optimization},
number = 3,
volume = 25,
place = {United States},
year = 2015,
month = 1
  • In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving only one subproblem which consist of a convex quadratic objective function and simple quadratic inequality constraints without the second derivatives of the functions of the discussed problems, and such a subproblem can be formulated as a second-order cone programming which can be solved by interior point methods. To overcome the Maratos effect, an efficient higher-order correction direction is obtained by onlymore » one explicit computation formula. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions without the strict complementarity. Finally, some preliminary numerical results are reported.« less
  • This paper discusses the efficient, practical and definitive algorithm for dealing with constrained load flow problems. Algorithms based on mathematical programming and algorithms based on the load flow calculation methods have been studied since earlier days. However, on account of numerous control variables to be determined and of inadequate calculating efficiency, the guarantee of unfailing solution is yet to be achieved. In the calculating procedure described the extent of adjustments are not determined simultaneously for all the control variables; the control variables considered likely to produce greater adjusting effect are selected one by one and are adjusted successively. This adjustmentmore » method, as a consequence, is useful not only for on-line power system operation but also as simulator software for training system operators.« less
  • We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrangemore » method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.« less
  • Cited by 4
  • The performance of Gaussian-2 theory is investigated when higher level theoretical methods are included for correlation effects, geometries, and zero-point energies. A higher level of correlation treatment is examined using Brueckner doubles [BD(T)] and coupled cluster [CCSD(T)] methods rather than quadratic configuration interaction [QCISD(T)]. The use of geometries optimized at the QCISD level rather than the second-order Moller--Plesset level (MP2) and the use of scaled MP2 zero-point energies rather than scaled Hartree--Fock (HF) zero-point energies have also been examined. The set of 125 energies used for validation of G2 theory [J. Chem. Phys. {bold 94}, 7221 (1991)] is used tomore » test out these variations of G2 theory. Inclusion of higher levels of correlation treatment has little effect except in the cases of multiply-bonded systems. In these cases better agreement is obtained in some cases and poorer agreement in others so that there is no improvement in overall performance. The use of QCISD geometries yields significantly better agreement with experiment for several cases including the ionization potentials of CS and O{sub 2}, electron affinity of CN, and dissociation energies of N{sub 2}, O{sub 2}, CN, and SO{sub 2}. This leads to a slightly better agreement with experiment overall. The MP2 zero-point energies gives no overall improvement. These methods may be useful for specific systems.« less