A neurodynamic approach to zero-one quadratic programming

DOI10.1007/S11075-021-01075-ZMaRDI QIDQ2234482zbMATH OpenOpenAlexFDO

Authors Haichan Lin, Yigui Ou

Publication date 19 October 2021

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-021-01075-z

zbMATH Keywords

convergence analysisstability analysis0-1 quadratic programmingNCP functionneurodynamic approach

Mathematics Subject Classification ID

Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Integer programming (90C10)

Recommendations

• A novel neural dynamical approach to convex quadratic program and its efficient applications
• A continuous approch for globally solving linearly constrained quadratic
• Neural network for solving quadratic programming problems
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming

Cites work

• scientific article; zbMATH DE number 3643044 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 53595 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A collaborative neurodynamic approach to global and combinatorial optimization
• A continuous approch for globally solving linearly constrained quadratic
• A continuous method model for solving general variational inequality
• A dynamic model to solve the absolute value equations
• A neurodynamic optimization approach for complex-variables programming problem
• A novel neural network for solving semidefinite programming problems with some applications
• Algorithms for the generalized independent set problem based on a quadratic optimization approach
• An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models
• An improved linearization technique for a class of quadratic 0-1 programming problems
• An interior point continuous path-following trajectory for linear programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Convex reformulation for binary quadratic programming problems via average objective value maximization
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Introduction to global optimization.
• Lagrange programming neural networks
• Neurodynamical optimization
• Nonlinear integer programming
• Penalty parameter for linearly constrained 0--1 quadratic programming
• Stability analysis of gradient-based neural networks for optimization problems

Cited in

(1)

• Saturation-allowed zeroing neural networks activated by various functions for time-varying quadratic programming

This page was built for publication: A neurodynamic approach to zero-one quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234482)