How to deal with the unbounded in optimization: Theory and algorithms
From MaRDI portal
Publication:1365044
DOI10.1007/BF02614308zbMATH Open0887.90131OpenAlexW1964143142MaRDI QIDQ1365044FDOQ1365044
Authors: A. 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
Recommendations
- scientific article; zbMATH DE number 88930
- scientific article; zbMATH DE number 4064386
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Algoritmi per problemi di ottimo non vincolato
- Optimality in problems and optimization algorithms under indeterminacy
- A finite algorithm for solving infinite dimensional optimization problems
- scientific article; zbMATH DE number 778130
- scientific article; zbMATH DE number 733518
- scientific article; zbMATH DE number 872648
- scientific article; zbMATH DE number 774968
surveyconvex analysisexistence of optimal solutionsrecession functionspenalty and barrier methodsunbounded sequences
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Analysis
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Modified barrier functions (theory and methods)
- A Parallel Algorithm for a Class of Convex Programs
- General existence theorems for unilateral problems in continuum mechanics
- Title not available (Why is that?)
- Smoothing methods for convex inequalities and linear complementarity problems
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Global error bounds for convex quadratic inequality systems*
- Nonlinear rescaling and proximal-like methods in convex optimization
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Noncoercive Optimization Problems
- A note on Palais-Smale condition and coercivity
- The palais-smale condition versus coercivity
- Optimal value function in semi-infinite programming
- Convergence of stationary sequences for variational inequalities with maximal monotone operators
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Well-posedness, condition number, and good asymptotic behaviour
- A parallel descent algorithm for convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity
- Coercivity properties and well-posedness in vector optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics
- Convex analysis can be helpful for the asymptotic analysis of monotone operators
- Asymptotical good behavior on inequalities with completely approximate K-T concept
- Noncoercive stationary Navier-Stokes equations of heat-conducting fluids modeled by hemivariational inequalities: an equilibrium problem approach
- On boundedness of (quasi-)convex integer optimization problems
- Dynamic bundle methods
- Existence of global minima for constrained optimization
- Set intersection theorems and existence of optimal solutions
- First-order rules for nonsmooth constrained optimization
- A metric approach to asymptotic analysis.
- On a Frank-Wolfe type theorem in cubic optimization
- Quadratic fractional programming under asymptotic analysis
- Convergence of asymptotic directions
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- Smoothing methods for nonsmooth, nonconvex minimization
- A further study on asymptotic functions via variational analysis
This page was built for publication: How to deal with the unbounded in optimization: Theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365044)
