Topics in Nonconvex Optimization: Theory and Applications

✍ Scribed by Qamrul Hasan Ansari, Jen-Chih Yao (auth.), Shashi Kant Mishra (eds.)

Publisher: Springer-Verlag New York
Year: 2011
Tongue: English
Leaves: 275
Series: Springer Optimization and Its Applications 50
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world systems for a very broad range of applications including engineering, mathematical economics, management science, financial engineering, and social science.

This contributed volume consists of selected contributions from the Advanced Training Programme on Nonconvex Optimization and Its Applications held at Banaras Hindu University in March 2009. It aims to bring together new concepts, theoretical developments, and applications from these researchers. Both theoretical and applied articles are contained in this volume which adds to the state of the art research in this field.

Topics in Nonconvex Optimization is suitable for advanced graduate students and researchers in this area.

✦ Table of Contents

Front Matter....Pages 1-13
Some Equivalences Among Nonlinear Complementarity Problems, Least-Element Problems, and Variational Inequality Problems in Ordered Spaces....Pages 1-25
Generalized Monotone Maps and Complementarity Problems....Pages 27-46
Optimality Conditions Without Continuity in Multivalued Optimization Using Approximations as Generalized Derivatives....Pages 47-61
Variational Inequality and Complementarity Problem....Pages 63-78
A Derivative for Semipreinvex Functions and Its Applications in Semipreinvex Programming....Pages 79-86
Proximal Proper Saddle Points in Set-Valued Optimization....Pages 87-100
Metric Regularity and Optimality Conditions in Nonsmooth Optimization....Pages 101-114
An Application of the Modified Subgradient Method for Solving Fuzzy Linear Fractional Programming Problem....Pages 115-131
On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity....Pages 133-145
Ekeland-Type Variational Principles and Equilibrium Problems....Pages 147-174
Decomposition Methods Based on Augmented Lagrangians: A Survey....Pages 175-203
Second-Order Symmetric Duality with Generalized Invexity....Pages 205-214
A Dynamic Solution Concept to Cooperative Games with Fuzzy Coalitions....Pages 215-230
Characterizations of the Solution Sets and Sufficient Optimality Criteria via Higher-Order Strong Convexity....Pages 231-242
Variational Inequalities and Optimistic Bilevel Programming Problem Via Convexifactors....Pages 243-255
On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d -Univex Functions; Duality....Pages 257-266
Back Matter....Pages 274-275

✦ Subjects

Operations Research, Management Science; Optimization; Calculus of Variations and Optimal Control; Optimization

📜 SIMILAR VOLUMES

Topics in Nonconvex Optimization: Theory

📁 Topics in Nonconvex Optimization: Theory and Applications

✍ Shashi K. Mishra (ed.) 📂 Library 📅 2011 🏛 Springer 🌐 English

<p>Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world

Duality Principles in Nonconvex Systems

📁 Duality Principles in Nonconvex Systems - Theory, Methods and Applications (Nonconvex Optimization and its Applications, Volume 39)

✍ David Yang Gao 📂 Library 📅 1999 🌐 English

Motivated by practical problems in engineering and physics, drawing on a wide range of applied mathematical disciplines, this book is the first to provide, within a unified framework, a self-contained comprehensive mathematical theory of duality for general non-convex, non-smooth systems, with e

Global Optimization: From Theory to Impl

📁 Global Optimization: From Theory to Implementation (Nonconvex Optimization and Its Applications)

✍ Leo Liberti, Nelson Maculan 📂 Library 📅 2006 🏛 Springer 🌐 English

Most global optimization literature focuses on theory. This book, however, contains descriptions of new implementations of general-purpose or problem-specific global optimization algorithms. It discusses existing software packages from which the entire community can learn. The contributors are exper

Multiscale Optimization Methods and Appl

📁 Multiscale Optimization Methods and Applications (Nonconvex Optimization and Its Applications, 82)

✍ William W. Hager (editor), Shu-Jen Huang (editor), Panos M. Pardalos (editor), O 📂 Library 📅 2005 🏛 Springer 🌐 English

<p><span>As optimization researchers tackle larger and larger problems, scale interactions play an increasingly important role. One general strategy for dealing with a large or difficult problem is to partition it into smaller ones, which are hopefully much easier to solve, and then work backwards t

Stochastic and Global Optimization (Nonc

📁 Stochastic and Global Optimization (Nonconvex Optimization and Its Applications)

✍ G. Dzemyda, V. Saltenis, A. Zilinskas 📂 Library 📅 2002 🏛 Springer 🌐 English

Dedicated to the 70th birthday of Professor J. Mockus, whose scientific interpretive theory and applications of global and discrete optimization, and stochastic programming were selected due to the theoretical soundness combined with practical applicability.

Global Optimization in Action: Continuou

📁 Global Optimization in Action: Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications (Nonconvex Optimization and Its Applications)

✍ Janos D. Pinter 📂 Library 📅 1995 🌐 English

In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of loca