Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints

DOI10.3934/naco.2011.1.83zbMath1219.90169OpenAlexW2328936146MaRDI QIDQ550510

Ailing Zhang, Shunsuke Hayashi

Publication date: 11 July 2011

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.83

zbMATH Keywords

nonconvex quadratic programmingfractional programminggeneralized Newton methodbisection methodCelis-Dennis-Tapia subproblems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Fractional programming (90C32)

Related Items (15)

Efficiently solving total least squares with Tikhonov identical regularization ⋮ Efficient algorithms for solving nonlinear fractional programming problems ⋮ A computational study of global optimization solvers on two trust region subproblems ⋮ On the quadratic fractional optimization with a strictly convex quadratic constraint ⋮ On the complex fractional quadratic optimization with a quadratic constraint ⋮ Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem ⋮ On the indefinite quadratic fractional optimization with two quadratic constraints ⋮ Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint ⋮ An iterative algorithm for the conic trust region subproblem ⋮ A global optimization approach to fractional optimal control ⋮ Fractional programming approach to a cost minimization problem in electricity market ⋮ On fractional quadratic optimization problem with two quadratic constraints ⋮ An SDP approach for quadratic fractional problems with a two-sided quadratic constraint ⋮ A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere ⋮ Quadratic optimization with two ball constraints

This page was built for publication: Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints