Foundations of optimization

Publication date: 1976

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convexity of real functions in one variable, generalizations (26A51) Polytopes and polyhedra (52Bxx)

Related Items

A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization, Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, A study of one-parameter regularization methods for mathematical programs with vanishing constraints, Constraint qualifications in the invex case, On optimality in abstract convex programming, Nonasymptotic necessary conditions for nonsmooth infinite optimization problems, Characterization of the cone of attainable directions, Representability in mixed integer programming. I: Characterization results, Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications, Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications, Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints, On constraint qualifications in directionally differentiable multiobjective optimization problems, Constraint qualifications and optimality conditions for optimization problems with cardinality constraints, A smoothing-regularization approach to mathematical programs with vanishing constraints, A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions, Interval methods for global optimization, Second-order necessary and sufficient conditions in multiobjective programming^∗, On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems, Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization, Control system design via infinite linear programming, On a Reformulation of Mathematical Programs with Cardinality Constraints, Approximation of nonconical preference relations in multiple-criteria decision problems, Nonlinear alternative theorems and nondifferentiable programming, New outer proximal methods for solving variational inequality problems, Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results, A generalization of Polyak's convergence result for subgradient optimization, A geometric approach to nonsmooth optimization with sample applications, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness., Non-differentiable pseudo-convex functions and duality for minimax programming problems, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, On efficiency in nonlinear fractional vector maximization problem, On second-order optimality conditions for vector optimization, Strict minimality conditions in nondifferentiable multiobjective programming, A gap between multiobjective optimization and scalar optimization, On the Caratheodory-John multiplier rule, Multiplier rules and the separation of convex sets, Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications, Lagrangean Methods and Optimal Stopping, On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems, Optimality conditions for nondifferentiable convex semi-infinite programming, Minimum problems on differentiable manifolds, On asphericity of convex bodies in linear normed spaces, Convexity and global well-posedness in set-optimization, A control problem of Rogak and Scott-Thomas, Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data, Proper efficiency in vector optimization on real linear spaces., Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method, Soluciones no dominadas en problemas multiobjetivo, About a gap between multiobjective optimization and scalar optimization, Intersection Properties of Tangent Cones and Generalized Multiplier Rules, Soluciones propias en la teoria de la dominacion, Programacion no lineal sin diferenciabilidad, Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones, Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints, On relaxing the Mangasarian-Fromovitz constraint qualification, Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization, Various types of nonsmooth invex functions, Regularity conditions for the linear separation of sets, Future paths for integer programming and links to artificial intelligence, A control problem of Rogak and Scott-Thomas, Some improved projected quasi-Newton algorithms and their convergence. I: Methods and global behavior, Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds, Generalized invexity for nonsmooth vector-valued mappings, Characterizing an optimal input in perturbed convex programming, Globally convergent decomposition methods for nonconvex optimization problems, Second-order mollified derivatives and optimization, Interval mathematics, algebraic equations and optimization, Regularity conditions for constrained extremum problems, Scalarization and stability in vector optimization, Finite convergence of algorithms for nonlinear programs and variational inequalities, Refinements of necessary conditions for optimality in nonlinear programming, New proof and some generalizations of the minimum principle in optimal control