An Iterative Working-Set Method for Large-Scale Nonconvex Quadratic Programming

Applied Numerical Mathematics - Netherlands
doi 10.1016/s0168-9274(02)00120-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences
2011English

An Unconstrained Binary Quadratic Programming for the Maximum Independent Set Problem

Nonlinear Analysis: Modelling and Control
Applied MathematicsAnalysis
2012English

The Simplex Method for Quadratic Programming

Econometrica
EconomicsEconometrics
1960English

A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2007English

New Method for Finding an Optimal Solution to Quadratic Programming Problems

Journal of Applied Sciences
2010English

QPDAS: Dual Active Set Solver for Mixed Constraint Quadratic Programming

2019English

Timing-Driven Bipartitioning With Replication Using Iterative Quadratic Programming

1999English

Stability of Lagrangian Duality for Nonconvex Quadratic Programming. Solution Methods and Applications in Computer Vision

ESAIM: Mathematical Modelling and Numerical Analysis
Numerical AnalysisApplied MathematicsAnalysisSimulationModelingComputational Mathematics
1997English

Robust Adaptive Beamforming Using Sequential Quadratic Programming: An Iterative Solution to the Mismatch Problem

IEEE Signal Processing Letters
Electronic EngineeringApplied MathematicsElectricalSignal Processing
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy