How to deal with the unbounded in optimization: Theory and algorithms
From MaRDI portal
Publication:1365044
DOI10.1007/BF02614308zbMath0887.90131OpenAlexW1964143142MaRDI QIDQ1365044
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
surveyconvex analysisexistence of optimal solutionsrecession functionspenalty and barrier methodsunbounded sequences
Related Items
Existence of global minima for constrained optimization ⋮ Dynamic bundle methods ⋮ Set intersection theorems and existence of optimal solutions ⋮ Asymptotical good behavior on inequalities with completely approximate K-T concept ⋮ A metric approach to asymptotic analysis. ⋮ Convergence of asymptotic directions ⋮ On a Frank-Wolfe type theorem in cubic optimization ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ Convex analysis can be helpful for the asymptotic analysis of monotone operators ⋮ Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity ⋮ First-order rules for nonsmooth constrained optimization ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes ⋮ On boundedness of (quasi-)convex integer optimization problems ⋮ From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics ⋮ A further study on asymptotic functions via variational analysis ⋮ Coercivity properties and well-posedness in vector optimization ⋮ Noncoercive stationary Navier-Stokes equations of heat-conducting fluids modeled by hemivariational inequalities: an equilibrium problem approach ⋮ Unnamed Item ⋮ Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
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
