Programmation mathématique convexe

DOI10.1051/M2AN/196802R100431MaRDI QIDQ5545151zbMATH OpenOpenAlexFDO

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