Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
From MaRDI portal
Publication:2379693
DOI10.1007/S10589-009-9243-8zbMATH Open1187.90210OpenAlexW2086578801MaRDI QIDQ2379693FDOQ2379693
Authors: Immanuel M. Bomze, Werner Schachinger 
Publication date: 19 March 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9243-8
Recommendations
- scientific article; zbMATH DE number 6474937
- Unconstrained formulation of standard quadratic optimization problems
- Quartic formulation of standard quadratic optimization problems
- A linear programming reformulation of the standard quadratic optimization problem
- On copositive programming and standard quadratic optimization problems
Cites Work
- Title not available (Why is that?)
- 10.1162/15324430260185619
- Pattern recognition and machine learning.
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Evolutionary Games and Population Dynamics
- Interior-Point Methods for Massive Support Vector Machines
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- A convergent decomposition algorithm for support vector machines
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- Training \(\nu\)-support vector classifiers: Theory and algorithms
- Title not available (Why is that?)
- A finite algorithm for solving general quadratic problems
- A conic duality Frank-Wolfe-type theorem via exact penalization in quadratic optimization
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
- Newton-KKT interior-point methods for indefinite quadratic programming
- On affine scaling algorithms for nonconvex quadratic programming
- Selection-induced convergence to equilibrium in a single-locus autosomal population
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Title not available (Why is that?)
- On the Foundations of Relaxation Labeling Processes
- The dynamics of nonlinear relaxation labeling processes.
Cited In (8)
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- Separable standard quadratic optimization problems
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization
- An affine scaling method for optimization problems with polyhedral constraints
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Nonparametric density estimation with nonuniform B-spline bases
Uses Software
This page was built for publication: Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379693)
