How to deal with the unbounded in optimization: Theory and algorithms

DOI10.1007/BF02614308zbMath0887.90131MaRDI QIDQ1365044

Alfred Auslender

Publication date: 25 May 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614308

zbMATH Keywords

survey; convex analysis; existence of optimal solutions; recession functions; penalty and barrier methods; unbounded sequences

Mathematics Subject Classification ID

90C25: Convex programming

49J52: Nonsmooth analysis

Related Items

Coercivity properties and well-posedness in vector optimization, Unnamed Item, On a Frank-Wolfe type theorem in cubic optimization, Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity, First-order rules for nonsmooth constrained optimization, Asymptotical good behavior on inequalities with completely approximate K-T concept, Smoothing methods for nonsmooth, nonconvex minimization, Existence of global minima for constrained optimization, Set intersection theorems and existence of optimal solutions, A bundle-filter method for nonsmooth convex constrained optimization, Convex analysis can be helpful for the asymptotic analysis of monotone operators, On boundedness of (quasi-)convex integer optimization problems, A metric approach to asymptotic analysis., Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems, A further study on asymptotic functions via variational analysis, Noncoercive stationary Navier-Stokes equations of heat-conducting fluids modeled by hemivariational inequalities: an equilibrium problem approach, Dynamic bundle methods, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Convergence of asymptotic directions, From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of stationary sequences for variational inequalities with maximal monotone operators
• Optimal value function in semi-infinite programming
• General existence theorems for unilateral problems in continuum mechanics
• A note on Palais-Smale condition and coercivity
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Modified barrier functions (theory and methods)
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• Nonlinear rescaling and proximal-like methods in convex optimization
• A parallel descent algorithm for convex programming
• Smoothing methods for convex inequalities and linear complementarity problems
• The palais-smale condition versus coercivity
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• A Parallel Algorithm for a Class of Convex Programs
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• On Convergence Properties of Algorithms for Unconstrained Minimization
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Noncoercive Optimization Problems
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Variational Analysis
• Global error bounds for convex quadratic inequality systems^*
• Convex Analysis