The following pages link to Alfred Auslender (Q229619):
Displaying 50 items.
- (Q687070) (redirect page) (← links)
- Convergence of stationary sequences for variational inequalities with maximal monotone operators (Q687071) (← links)
- Penalty and barrier methods for convex semidefinite programming (Q883081) (← links)
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351) (← links)
- Two general methods for computing saddle points with applications for decomposing convex programming problems (Q1069674) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- (Q1122489) (redirect page) (← links)
- Well behaved asymptotical convex functions (Q1122490) (← links)
- A logarithmic-quadratic proximal method for variational inequalities (Q1294804) (← links)
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems (Q1321191) (← links)
- Second order viability problems for differential inclusions (Q1323235) (← links)
- On closed convex sets without boundary rays and asymptotes (Q1332531) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Existence of optimal solutions and duality results under weak conditions (Q1591355) (← links)
- Primal and dual stability results for variational inequalities (Q1841552) (← links)
- Sensitivity analysis for generalized linear-quadratic problems (Q1918287) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Comparative study of RPSALG algorithm for convex semi-infinite programming (Q2515065) (← links)
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables (Q2545648) (← links)
- Problèmes de minimax via l'analyse convexe et les inégalités variationelles: Théorie et algorithmes (Q2557177) (← links)
- Interior projection-like methods for monotone variational inequalities (Q2570999) (← links)
- (Q2768005) (← links)
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
- (Q3057939) (← links)
- Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization (Q3058511) (← links)
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems (Q3083329) (← links)
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming (Q3169036) (← links)
- (Q3311202) (← links)
- Stability in Mathematical Programming with Nondifferentiable Data (Q3324529) (← links)
- (Q3342220) (← links)
- First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions (Q3351163) (← links)
- (Q3688115) (← links)
- (Q3773712) (← links)
- Global Regularity Theorems (Q3802890) (← links)
- (Q3869094) (← links)
- (Q3911679) (← links)
- (Q3918642) (← links)
- Penalty methods for computing points that satisfy second order necessary conditions (Q3962792) (← links)
- A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming (Q3978614) (← links)
- (Q4043676) (← links)
- (Q4045249) (← links)
- Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit (Q4057223) (← links)
- (Q4091727) (← links)
- (Q4117581) (← links)
- (Q4133413) (← links)
- (Q4146573) (← links)
- (Q4147883) (← links)
