default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfred Auslender
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j30]Alfred Auslender, Alberto Ferrer
, Miguel A. Goberna, Marco A. López:
Comparative study of RPSALG algorithm for convex semi-infinite programming. Comput. Optim. Appl. 60(1): 59-87 (2015)- [j29]Alfred Auslender:
An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming. SIAM J. Optim. 25(3): 1732-1759 (2015) - 2013
- [j28]Alfred Auslender:
An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming. J. Optim. Theory Appl. 156(2): 183-212 (2013) - [j27]Alfred Auslender:
A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results. Math. Program. 142(1-2): 349-369 (2013) - 2010
- [j26]Alfred Auslender:
Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization. SIAM J. Optim. 20(4): 1868-1884 (2010) - [j25]Alfred Auslender, Ron Shefi, Marc Teboulle:
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems. SIAM J. Optim. 20(6): 3232-3259 (2010) - 2009
- [j24]Alfred Auslender, Miguel A. Goberna, Marco A. López:
Penalty and Smoothing Methods for Convex Semi-Infinite Programming. Math. Oper. Res. 34(2): 303-319 (2009) - [j23]Alfred Auslender, Marc Teboulle:
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. Math. Program. 120(1): 27-48 (2009) - 2007
- [j22]Alfred Auslender, Paulo J. S. Silva, Marc Teboulle:
Nonmonotone projected gradient methods based on barrier and Euclidean distances. Comput. Optim. Appl. 38(3): 305-327 (2007) - 2006
- [j21]Alfred Auslender, Héctor Ramírez Cabrera:
Penalty and Barrier Methods for Convex Semidefinite Programming. Math. Methods Oper. Res. 63(2): 195-219 (2006) - [j20]Alfred Auslender, Marc Teboulle:
Interior Gradient and Proximal Methods for Convex and Conic Optimization. SIAM J. Optim. 16(3): 697-725 (2006) - 2005
- [j19]Alfred Auslender, Marc Teboulle:
Interior projection-like methods for monotone variational inequalities. Math. Program. 104(1): 39-68 (2005) - 2004
- [j18]Alfred Auslender, Marc Teboulle:
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization. Math. Oper. Res. 29(1): 1-26 (2004) - 2003
- [j17]Alfred Auslender:
Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone. Optim. Methods Softw. 18(4): 359-376 (2003) - 2001
- [j16]Alfred Auslender, Marc Teboulle:
Entropic proximal decomposition methods for convex programs and variational inequalities. Math. Program. 91(1): 33-47 (2001) - 2000
- [j15]Alfred Auslender, Rafael Correa:
Primal and Dual Stability Results for Variational Inequalities. Comput. Optim. Appl. 17(2-3): 117-130 (2000) - [j14]Alfred Auslender:
Existence of optimal solutions and duality results under weak conditions. Math. Program. 88(1): 45-59 (2000) - [j13]Alfred Auslender, Marc Teboulle:
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems. SIAM J. Optim. 10(4): 1097-1115 (2000) - 1999
- [j12]Alfred Auslender, Marc Teboulle, Sami Ben-Tiba:
A Logarithmic-Quadratic Proximal Method for Variational Inequalities. Comput. Optim. Appl. 12(1-3): 31-40 (1999) - [j11]Alfred Auslender, Marc Teboulle, Sami Ben-Tiba:
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. Math. Oper. Res. 24(3): 645-668 (1999) - [j10]Alfred Auslender:
Penalty and Barrier Methods: A Unified Framework. SIAM J. Optim. 10(1): 211-230 (1999) - 1997
- [j9]Alfred Auslender, Roberto Cominetti, Mounir Haddou:
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. Math. Oper. Res. 22(1): 43-62 (1997) - [j8]Alfred Auslender:
How to deal with the unbounded in optimization: Theory and algorithms. Math. Program. 79: 3-18 (1997) - 1996
- [j7]Alfred Auslender:
Noncoercive Optimization Problems. Math. Oper. Res. 21(4): 769-782 (1996) - 1995
- [j6]Alfred Auslender, Mounir Haddou:
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. Math. Program. 71: 77-100 (1995) - 1993
- [j5]Alfred Auslender, Roberto Cominetti, Jean-Pierre Crouzeix:
Convex Functions with Unbounded Level Sets and Applications to Duality Theory. SIAM J. Optim. 3(4): 669-687 (1993) - 1991
- [j4]Alfred Auslender, Roberto Cominetti:
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming. Math. Oper. Res. 16(2): 240-258 (1991) - 1988
- [j3]Alfred Auslender, Jean-Pierre Crouzeix:
Global Regularity Theorems. Math. Oper. Res. 13(2): 243-253 (1988) - 1982
- [j2]Alfred Auslender:
On the differential properties of the support function of the ∈-subdifferential of a convex function. Math. Program. 24(1): 257-268 (1982) - 1979
- [j1]Alfred Auslender:
Penalty methods for computing points that satisfy second order necessary conditions. Math. Program. 17(1): 229-238 (1979)
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 2025-06-17 00:08 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:
