Quadratic optimization over a polyhedral cone
DOI10.3934/JIMO.2016.12.269zbMATH Open1317.90246OpenAlexW2318766299MaRDI QIDQ2515280FDOQ2515280
Ye Tian, Qingwei Jin, Zhibin Deng
Publication date: 31 July 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.269
quadratic optimizationpolyhedral conecone of nonnegative quadratic formsadaptive schemelinear conic programming approximation
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Approximation in the complex plane (30E10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On the copositive representation of binary and continuous nonconvex quadratic programs
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
- A graph theoretic approach to strong monotonicity with respect to polyhedral cones
- Exact computable representation of some second-order cone constrained quadratic programming problems
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Quadratic optimization over one first-order cone
- Review of methods for increasing discrimination in data envelopment analysis
- A Trust Region Method for Solving Generalized Complementarity Problems
- A superlinearly convergent method for the generalized complementarity problem over a polyhedral cone
Cited In (12)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Quadratic optimization over one first-order cone
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Bi-parametric convex quadratic optimization
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- Title not available (Why is that?)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Solving conic quadratically constrained quadratic programming problems
- Quadratic geometric programming with application to machining economics
- Quadratic optimization over a second-order cone with linear equality constraints
- Title not available (Why is that?)
Uses Software
This page was built for publication: Quadratic optimization over a polyhedral cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515280)
