On the convexification of nonlinear programming problems: An applications-oriented survey
From MaRDI portal
Publication:799590
DOI10.1016/0377-2217(84)90107-3zbMath0547.90082OpenAlexW2037764240MaRDI QIDQ799590
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90107-3
surveyconvexificationgeometric programmingconvex-concave fractional programmingdomain transformationrange transformationtransformability
Convex programming (90C25) Nonlinear programming (90C30) Fractional programming (90C32) Numerical methods based on nonlinear programming (49M37) Mathematical programming (90C99)
Related Items
A survey of hidden convex optimization, On convexification for a class of global optimization problems, A Fourth bibliography of fractional programming, Convexification of nonsmooth monotone functions, Proper efficiency in nonconvex vector-maximization-problems, Existence and sum decomposition of vertex polyhedral convex envelopes, Generalized Convexity in Nonlinear Programming, Hidden convex minimization, Reformulations in Mathematical Programming: Definitions and Systematics, New Kuhn-Tucker sufficiency for global optimality via convexification, Exponential transformation in convexifying a noninferior frontier and exponential generating method, On the global minimization of concave functions, Global optimization algorithms for linearly constrained indefinite quadratic problems, Average shadow prices in mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional programming: Applications and algorithms
- Generalized concavity
- Minimization of ratios
- On generalized means and generalized convex functions
- Second-order characterizations of pseudo-convex quadratic functions
- Least concave utility functions
- Concavifiability and constructions of concave utility functions
- Sulle stratificazioni convesse
- A note on the convergence of an algorithm for nonconvex programming problems
- On the computational utility of posynomial geometric programming solution methods
- An algorithm for nonconvex programming problems
- Fractional Programming. II, On Dinkelbach's Algorithm
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Objective function approximations in mathematical programming
- Second order characterizations of pseudoconvex functions
- An Algorithm for Separable Nonconvex Programming Problems
- r-convex functions
- A note on functions whose local minima are global