scientific article; zbMATH DE number 2201293
From MaRDI portal
Publication:5313725
zbMath1124.90018MaRDI QIDQ5313725
Frédéric Delbos, Gilbert, Jean Charles
Publication date: 1 September 2005
Full work available at URL: http://www.heldermann.de/JCA/JCA12/JCA121/jca12003.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
error boundlinear constraintsproximal algorithmconvex quadratic optimizationglobal linear convergenceAugmented Lagrangianiterative complexitydistance to a polyhedron
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Related Items (5)
Primal and dual active-set methods for convex quadratic programming ⋮ Exploring stochasticity and imprecise knowledge based on linear inequality constraints ⋮ A generalized computing paradigm based on artificial dynamic models for mathematical programming ⋮ On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope ⋮ An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
This page was built for publication:
