scientific article
From MaRDI portal
Publication:3186414
zbMath1347.49049MaRDI QIDQ3186414
Gilbert, Jean Charles, A. Chiche
Publication date: 9 August 2016
Full work available at URL: http://www.heldermann.de/JCA/JCA23/JCA232/jca23016.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex quadratic optimizationaugmented Lagrangian algorithmaugmentation parameter updateinfeasible problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)
Related Items (7)
Primal and dual active-set methods for convex quadratic programming ⋮ Study on convex optimization with least constraint violation under a general measure ⋮ The augmented Lagrangian method can approximately solve convex optimization with least constraint violation ⋮ An overview of nonlinear optimization ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ 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:
