A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
From MaRDI portal
Recommendations
- A dual method for solving positive definite quadratic programming
- A dual-active-set algorithm for positive semi-definite quadratic programming
- Positive semidefinite penalty method for quadratically constrained quadratic programming
- A variant of the dual simplex method for a linear semidefinite programming problem
- scientific article; zbMATH DE number 1241353
- A dual parameterization approach to linear-quadratic semi-infinite programming problems
- A new quadratic semi-infinite programming algorithm based on dual parametrization
- On doubly positive semidefinite programming relaxations
- Duality bound method for the general quadratic programming problem with quadratic constraints
Cited in
(33)- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A convergent decomposition algorithm for support vector machines
- Approximations in proximal bundle methods and decomposition of convex programs
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Codifferential method for minimizing nonsmooth DC functions
- Solving nonlinear programming problems with noisy function values and noisy gradients
- Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality
- On active-set methods for the quadratic programming problem
- On the rate of convergence of two minimax algorithms
- A dual method for solving positive definite quadratic programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Iterative schemes for the least 2-norm solution of piecewise linear programs
- Redundancies in positive-semidefinite quadratic programming
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Comparison of bundle and classical column generation
- A bundle-type algorithm for routing in telecommunication data networks
- Finding normal solutions in piecewise linear programming
- A numerically stable dual method for solving strictly convex quadratic programs
- Dual support method for solving convex quadratic programs
- A primal-proximal heuristic applied to the French unit-commitment problem
- A dual-active-set algorithm for positive semi-definite quadratic programming
- Caputo fractional derivative operational matrices of Legendre and Chebyshev wavelets in fractional delay optimal control
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- Estimating ordered parameters by linear programming
- scientific article; zbMATH DE number 3950212 (Why is no real title available?)
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- Parallel decomposition of multistage stochastic programming problems
- Elastoplastic analysis of structures under uncertainty: model and solution methods1
- scientific article; zbMATH DE number 4112388 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
This page was built for publication: A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813167)
