Programmation mathématique convexe

DOI10.1051/M2AN/196802R100431zbMATH Open0159.48602OpenAlexW2586151490MaRDI QIDQ5545151FDOQ5545151

Authors: P. Huard 

Publication date: 1968

Published in: Revue française d'informatique et de recherche opérationnelle (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193097

zbMATH Keywords

operations research

Cited In (11)

• Some representation theorems for functions and sets and their application to nonlinear programming
• Method of centers for generalized fractional programming
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Penalty-proximal methods in convex programming
• On the rate of convergence of certain methods of centers
• Iteration processes of convex programming with internal regularization
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
• Optimization algorithms and point-to-set-maps
• Prox-regularization of the dual method of centers for generalized fractional programs

This page was built for publication: Programmation mathématique convexe

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545151)