Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid-Reference-Cited by-同舟云学术

Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid

Published:1996-10 Issue:1 Volume:94 Page:167-178
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Flippo Olaf E.,Jansen Benjamin

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. New optimality conditions and algorithms for homogeneous and polynomial optimization over spheres;Bagchi,1990

2. Iterative solution of problems of linear and quadratic programming;Dikin;Soviet Mathematics Doklady,1967

3. Computing optimal locally constrained steps;Gay;SIAM Journal on Scientific and Statistical Computing,1981

4. 3. Duality in Nonlinear Programming: A simplified applications-oriented development;Geoffrion,1972

5. Maximization by quadratic hill-climbing;Goldfelf;Econometrica,1966

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Invariants of SDP exactness in quadratic programming;Journal of Symbolic Computation;2024-05

2. Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem;Mathematics of Operations Research;2022-11

3. Strong Duality for General Quadratic Programs with Quadratic Equality Constraints;Journal of Optimization Theory and Applications;2022-08-24

4. Cubic Regularization Methods with Second-Order Complexity Guarantee Based on a New Subproblem Reformulation;Journal of the Operations Research Society of China;2022-04-15

5. An accelerated first-order method with complexity analysis for solving cubic regularization subproblems;Computational Optimization and Applications;2021-03-27