Algorithm and separating method for the optimisation of quadratic functions (original) (raw)

Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra

Andres Francisco España Gomez

Mathematical Programming Computation, 2018

View PDFchevron_right

Introduction to Global Optimization over Polyhedrons

Mojca Stemberger

View PDFchevron_right

On the Maximization of a Concave Quadratic Function with Box Constraints

Ana Friedlander

SIAM Journal on Optimization, 1994

View PDFchevron_right

An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

hoai an

Mathematical Programming, 2000

View PDFchevron_right

TIGHT BOUNDING OF CONTINUOUS FUNCTIONS OVER POLYHEDRONS: A NEW INTRODUCTION TO EXACT GLOBAL OPTIMIZATION

Hossein Arsham

International Journal of Pure and Applied Mathematics, 2005

View PDFchevron_right

BOXCQP: an algorithm for bound constrained convex quadratic problems

Costas Voglis

2004

View PDFchevron_right

Global optimization of concave functions subject to separable quadratic constraints and of all-quadratic separable problems

Panos M Pardalos

1988

View PDFchevron_right

A new algorithm for quadratic programming

Tamás Terlaky

European Journal of Operational Research, 1987

View PDFchevron_right

Minimization of quadratic functions on convex sets without asymptotes

Wilfredo Sosa

2018

View PDFchevron_right

Generalized polyhedral convex optimization problems

Nguyen Luan

Journal of Global Optimization, 2019

View PDFchevron_right

Inscribed ball and enclosing box methods for the convex maximization problem

Guillaume Guérard

Optimization Letters, 2015

View PDFchevron_right

A maximization algorithm of pseudo-convex quadratic functions

Mourad Taj

Boletim da Sociedade Paranaense de Matemática, 2022

View PDFchevron_right

Global minimization of large-scale constrained concave quadratic problems by separable programming

Panos M Pardalos

Mathematical Programming, 1986

View PDFchevron_right

A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems

Muu Le Dung

Journal of Combinatorial Optimization, 1998

View PDFchevron_right

An interior-exterior approach for convex quadratic programming

Safae el haj ben ali

Applied Numerical Mathematics, 2011

View PDFchevron_right

Concave Minimization Via Collapsing Polytopes

James Falk

Operations Research, 1986

View PDFchevron_right

Global quadratic optimization via conic relaxation

Yurii Nesterov

1998

View PDFchevron_right

Finding saddle points on polyhedra : solving certain continuous minimax problems / 1993:109

George Monahan

1993

View PDFchevron_right

A smoothing SQP framework for a class of composite L_q$$ L q minimization over polyhedron

Shuzhong Zhang

Mathematical Programming, 2015

View PDFchevron_right

Advances in convex optimization: conic programming

Arkadi Nemirovski

Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006, 2007

View PDFchevron_right

Quadratic Programming with Quadratic Constraints

Jan De Leeuw

View PDFchevron_right

A Newton-Type Method for Convex Quadratic Programming

Vasile Moraru

View PDFchevron_right

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra

andras frank

Mathematics of Operations Research

View PDFchevron_right

Quadratic Optimization Problems

Jean Gallier

Texts in Applied Mathematics, 2011

View PDFchevron_right

Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming

Panos M Pardalos

Annals of Operations Research, 1992

View PDFchevron_right

Global optimization algorithms for linearly constrained indefinite quadratic problems

Panos M Pardalos

Computers & Mathematics with Applications, 1991

View PDFchevron_right

New approaches for optimizing over the semimetric polytope

Andrea Lodi

Mathematical Programming, 2005

View PDFchevron_right

On implementing a primal-dual interior-point method for conic quadratic optimization

Tamás Terlaky

Mathematical Programming, 2003

View PDFchevron_right

Explicit minimisation of a convex quadratic under a general quadratic constraint

Casper Albers

2007

View PDFchevron_right

Finding saddle points on polyhedra: Solving certain continuous minimax problems

George Monahan

Naval Research Logistics, 1996

View PDFchevron_right

Separation of convex polyhedral sets with column parameters

Milan Hladík

Kybernetika -Praha-

View PDFchevron_right

A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems

Quy Nguyen Van

Journal of Global Optimization, 2003

View PDFchevron_right

A Polynomial Method of Weighted Centers for Convex Quadratic Programming

Cornelis Roos

Journal of Information and Optimization Sciences, 1991

View PDFchevron_right