A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach

International audience

Data and Resources

Additional Info

Field Value
Source ISSN: 0025-5610
Author Armand, Paul, Gilbert, Jean Charles, Jan-Jégou, Sophie
Maintainer CCSD
Last Updated May 6, 2026, 03:51 (UTC)
Created May 6, 2026, 03:51 (UTC)
Identifier hal-00955215
Language en
contributor Laboratoire d'Arithmétique, de Calcul formel et d'Optimisation (LACO) ; Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)
creator Armand, Paul
date 2002-05-06T00:00:00
harvest_object_id d75a3d3f-fc38-4030-af36-806b0e4bf835
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-10-22T00:00:00
relation info:eu-repo/semantics/altIdentifier/doi/10.1007/s101070100283
set_spec type:ART