default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Louis Goffin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j31]A. Dehghani, Jean-Louis Goffin, Dominique Orban:
A primal-dual regularized interior-point method for semidefinite programming. Optim. Methods Softw. 32(1): 193-219 (2017)
2000 – 2009
- 2009
- [r2]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization. Encyclopedia of Optimization 2009: 2584-2590 - [r1]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization: Cutting Plane Methods. Encyclopedia of Optimization 2009: 2590-2595 - 2007
- [j30]Mohammad R. Oskoorouchi, Jean-Louis Goffin:
A matrix generation approach for eigenvalue optimization. Math. Program. 109(1): 155-179 (2007) - 2005
- [j29]Michel Denault, Jean-Louis Goffin:
The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach. INFORMS J. Comput. 17(2): 192-206 (2005) - [j28]Samir Elhedhli, Jean-Louis Goffin:
Efficient Production-Distribution System Design. Manag. Sci. 51(7): 1151-1164 (2005) - [j27]Mohammad R. Oskoorouchi, Jean-Louis Goffin:
An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities. Math. Oper. Res. 30(1): 127-149 (2005) - [j26]Fatma Gzara, Jean-Louis Goffin:
Exact solution of the centralized network design problem on directed graphs. Networks 45(4): 181-192 (2005) - 2004
- [j25]Michel Denault, Jean-Louis Goffin:
Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach. Comput. Oper. Res. 31(5): 721-743 (2004) - [j24]Samir Elhedhli, Jean-Louis Goffin:
The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100(2): 267-294 (2004) - 2003
- [j23]Mohammad R. Oskoorouchi, Jean-Louis Goffin:
The Analytic Center Cutting Plane Method with Semidefinite Cuts. SIAM J. Optim. 13(4): 1029-1053 (2003) - 2002
- [j22]Faranak Sharifi Mokhtarian, Jean-Louis Goffin:
An analytic center quadratic cut method for the convex quadratic feasibility problem. Math. Program. 93(2): 305-325 (2002) - [j21]Jean-Louis Goffin, Jean-Philippe Vial:
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5): 805-867 (2002) - 2000
- [j20]Jean-Louis Goffin, Jean-Philippe Vial:
Multiple Cuts in the Analytic Center Cutting Plane Method. SIAM J. Optim. 11(1): 266-288 (2000)
1990 – 1999
- 1999
- [j19]Michel Denault, Jean-Louis Goffin:
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities. Comput. Optim. Appl. 12(1-3): 127-155 (1999) - [j18]Jean-Louis Goffin, Jean-Philippe Vial:
A two-cut approach in the analytic center cutting plane method. Math. Methods Oper. Res. 49(1): 149-169 (1999) - [j17]Jean-Louis Goffin, Jean-Philippe Vial:
Shallow, deep and very deep cuts in the analytic center cutting plane method. Math. Program. 84(1): 89-103 (1999) - [j16]Jean-Louis Goffin, Krzysztof C. Kiwiel:
Convergence of a simple subgradient level method. Math. Program. 85(1): 207-211 (1999) - 1998
- [j15]Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial:
On Improvements to the Analytic Center Cutting Plane Method. Comput. Optim. Appl. 11(1): 37-52 (1998) - [j14]Faranak Sharifi Mokhtarian, Jean-Louis Goffin:
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems. SIAM J. Optim. 8(4): 1108-1131 (1998) - 1997
- [j13]Jean-Louis Goffin, Patrice Marcotte, Daoli Zhu:
An analytic center cutting plane method for pseudomonotone variational inequalities. Oper. Res. Lett. 20(1): 1-6 (1997) - 1996
- [j12]Jean-Louis Goffin, Jacek Gondzio
, Robert Sarkissian, Jean-Philippe Vial:
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76: 131-154 (1996) - [j11]Jean-Louis Goffin, Zhi-Quan Luo, Yinyu Ye:
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems. SIAM J. Optim. 6(3): 638-652 (1996) - 1995
- [j10]Olivier Bahn, Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial:
A cutting plane method from analytic centers for stochastic programming. Math. Program. 69: 45-73 (1995) - 1994
- [j9]Olivier Bahn, Jean-Louis Goffin, Jean-Philippe Vial, Olivier du Merle:
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. Discret. Appl. Math. 49(1-3): 3-23 (1994) - [j8]Jean-Louis Goffin, Jean-Philippe Vial:
Short Steps with Karmarkar's Projective Algorithm for Linear Programming. SIAM J. Optim. 4(1): 193-207 (1994) - 1993
- [j7]Jean-Louis Goffin, Jean-Philippe Vial:
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Math. Program. 60: 81-92 (1993)
1980 – 1989
- 1984
- [j6]Jean-Louis Goffin:
Variable metric relaxation methods, part II: The ellipsoid method. Math. Program. 30(2): 147-162 (1984) - 1983
- [j5]Jean-Louis Goffin:
Convergence Rates of the Ellipsoid Method on General Convex Functions. Math. Oper. Res. 8(1): 135-150 (1983) - 1982
- [j4]Jean-Louis Goffin:
On the non-polynomiality of the relaxation method for systems of linear inequalities. Math. Program. 22(1): 93-103 (1982) - [j3]Jean-Louis Goffin:
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities. Math. Program. 22(1): 239-260 (1982) - 1980
- [j2]Jean-Louis Goffin:
The Relaxation Method for Solving Systems of Linear Inequalities. Math. Oper. Res. 5(3): 388-414 (1980)
1970 – 1979
- 1977
- [j1]Jean-Louis Goffin:
On convergence rates of subgradient optimization methods. Math. Program. 13(1): 329-347 (1977) - 1973
- [c1]Jean-Louis Goffin, Alain Haurie:
Necessary Conditions and Sufficient Conditions for Pareto Optimality in a Multicriterion Perturbed System. Optimization Techniques 1973: 184-193
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-04-24 22:48 CEST 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:
