default search action
Michel Volle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Miguel A. Goberna
, Michel Volle:
Duality for convex infinite optimization on linear spaces. Optim. Lett. 16(8): 2501-2510 (2022) - [j20]Miguel A. Goberna
Correction to: Duality for convex infinite optimization on linear spaces. Optim. Lett. 16(8): 2511 (2022) - 2021
- [j19]Nguyen Dinh, Miguel A. Goberna
Duality for constrained robust sum optimization problems. Math. Program. 189(1): 271-297 (2021) - [j18]Dinh The Luc, Michel Volle:
Duality for extended infinite monotropic optimization problems. Math. Program. 189(1): 409-432 (2021)
2010 – 2019
- 2019
- [j17]Nguyen Dinh, Miguel A. Goberna
Convexity and closedness in stable robust duality. Optim. Lett. 13(2): 325-339 (2019) - [j16]Dinh The Luc, Michel Volle:
Duality for Optimization Problems with Infinite Sums. SIAM J. Optim. 29(3): 1819-1843 (2019) - 2017
- [j15]Nguyen Dinh, Miguel Angel Goberna
A Unifying Approach to Robust Convex Infinite Optimization Duality. J. Optim. Theory Appl. 174(3): 650-685 (2017) - [j14]Nguyen Dinh, Tran Hong Mo, Guy Vallet, Michel Volle:
A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems. SIAM J. Optim. 27(2): 1075-1101 (2017) - 2015
- [j13]Michel Volle, J. E. Martínez-Legaz
Duality for Closed Convex Functions and Evenly Convex Functions. J. Optim. Theory Appl. 167(3): 985-997 (2015) - 2014
- [j12]Nguyen Dinh, Guy Vallet, Michel Volle:
Functional inequalities and theorems of the alternative involving composite functions. J. Glob. Optim. 59(4): 837-863 (2014) - 2013
- [j11]Emil Ernst
Zero Duality Gap for Convex Programs: A Generalization of the Clark-Duffin Theorem. J. Optim. Theory Appl. 158(3): 668-686 (2013) - 2010
- [j10]Nguyen Dinh, Marco A. López
Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization. SIAM J. Optim. 20(5): 2540-2559 (2010)
2000 – 2009
- 2006
- [j9]Dinh The Luc, Thai Quynh Phong, Michel Volle:
A New Duality Approach to Solving Concave Vector Maximization Problems. J. Glob. Optim. 36(3): 401-423 (2006) - 2005
- [j8]Michel Volle:
La place de l'aide à la décision dans le système d'information. Monde des Util. Anal. Données 32: 57-69 (2005) - [j7]Dinh The Luc, Thai Quynh Phong, Michel Volle:
Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems. SIAM J. Optim. 15(4): 987-1001 (2005) - 2004
- [j6]Jean-Paul Penot, Michel Volle:
Surrogate Programming and Multipliers in Quasi-convex Programming. SIAM J. Control. Optim. 42(6): 1994-2003 (2004) - [c1]Michel Volle:
Fonctionnement d'un système informatique d'aide à la décision (SIAD). EGC 2004: 15-23
1990 – 1999
- 1998
- [j5]Bernard Lemaire, Michel Volle:
A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint. J. Glob. Optim. 13(3): 317-327 (1998) - 1994
- [j4]Michel Volle:
Calculus rules for global approximate minima and applications to approximate subdifferential calculus. J. Glob. Optim. 5(2): 131-157 (1994) - 1990
- [j3]Jean-Paul Penot, Michel Volle:
Inversion of real-valued functions and applications. ZOR Methods Model. Oper. Res. 34(2): 117-141 (1990) - [j2]Jean-Paul Penot, Michel Volle:
On Quasi-Convex Duality. Math. Oper. Res. 15(4): 597-625 (1990)
1980 – 1989
- 1988
- [j1]Michel Volle:
Concave duality: Application to problems dealing with difference of functions. Math. Program. 41(1-3): 261-278 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: