Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Applied functional analysis has an extensive history. In the last century, this field has often been used in physical sciences, such as wave and heat phenomena. In recent decades, with the development of nonlinear functional analysis, this field has been used to model a variety of engineering, medical, and computer sciences. Two of the most significant issues in this area are modeling and optimization. Thus, we consider some recently published works on fixed point, variational inequalities, and optimization problems. These works could lead readers to obtain new novelties and familiarize them with some applications of this area.

vector variational-like inequalities --- vector optimization problems --- limiting (p,r)-α-(η,θ)-invexity --- Lipschitz continuity --- Fan-KKM theorem --- set-valued optimization problems --- higher-order weak adjacent epiderivatives --- higher-order mond-weir type dual --- benson proper efficiency --- fractional calculus --- ψ-fractional integrals --- fractional differential equations --- contraction --- hybrid contractions --- volterra fractional integral equations --- fixed point --- inertial-like subgradient-like extragradient method with line-search process --- pseudomonotone variational inequality problem --- asymptotically nonexpansive mapping --- strictly pseudocontractive mapping --- sequentially weak continuity --- method with line-search process --- pseudomonotone variational inequality --- strictly pseudocontractive mappings --- common fixed point --- hyperspace --- informal open sets --- informal norms --- null set --- open balls --- modified implicit iterative methods with perturbed mapping --- pseudocontractive mapping --- strongly pseudocontractive mapping --- nonexpansive mapping --- weakly continuous duality mapping --- set optimization --- set relations --- nonlinear scalarizing functional --- algebraic interior --- vector closure --- conjugate gradient method --- steepest descent method --- hybrid projection --- shrinking projection --- inertial Mann --- strongly convergence --- strict pseudo-contraction --- variational inequality problem --- inclusion problem --- signal processing

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Research on interior-point methods (IPMs) has dominated the field of mathematical programming for the last two decades. Two contrasting approaches in the analysis and implementation of IPMs are the so-called small-update and large-update methods, although, until now, there has been a notorious gap between the theory and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function. The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs. Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work.

Interior-point methods. --- Mathematical optimization. --- Programming (Mathematics). --- Mathematical optimization --- Interior-point methods --- Programming (Mathematics) --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Operations Research --- Mathematical programming --- Goal programming --- Algorithms --- Functional equations --- Operations research --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Simulation methods --- System analysis --- 519.85 --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.85 Mathematical programming --- Accuracy and precision. --- Algorithm. --- Analysis of algorithms. --- Analytic function. --- Associative property. --- Barrier function. --- Binary number. --- Block matrix. --- Combination. --- Combinatorial optimization. --- Combinatorics. --- Complexity. --- Conic optimization. --- Continuous optimization. --- Control theory. --- Convex optimization. --- Delft University of Technology. --- Derivative. --- Differentiable function. --- Directional derivative. --- Division by zero. --- Dual space. --- Duality (mathematics). --- Duality gap. --- Eigenvalues and eigenvectors. --- Embedding. --- Equation. --- Estimation. --- Existential quantification. --- Explanation. --- Feasible region. --- Filter design. --- Function (mathematics). --- Implementation. --- Instance (computer science). --- Invertible matrix. --- Iteration. --- Jacobian matrix and determinant. --- Jordan algebra. --- Karmarkar's algorithm. --- Karush–Kuhn–Tucker conditions. --- Line search. --- Linear complementarity problem. --- Linear function. --- Linear programming. --- Lipschitz continuity. --- Local convergence. --- Loss function. --- Mathematician. --- Mathematics. --- Matrix function. --- McMaster University. --- Monograph. --- Multiplication operator. --- Newton's method. --- Nonlinear programming. --- Nonlinear system. --- Notation. --- Operations research. --- Optimal control. --- Optimization problem. --- Parameter (computer programming). --- Parameter. --- Pattern recognition. --- Polyhedron. --- Polynomial. --- Positive semidefinite. --- Positive-definite matrix. --- Quadratic function. --- Requirement. --- Result. --- Scientific notation. --- Second derivative. --- Self-concordant function. --- Sensitivity analysis. --- Sign (mathematics). --- Signal processing. --- Simplex algorithm. --- Simultaneous equations. --- Singular value. --- Smoothness. --- Solution set. --- Solver. --- Special case. --- Subset. --- Suggestion. --- Technical report. --- Theorem. --- Theory. --- Time complexity. --- Two-dimensional space. --- Upper and lower bounds. --- Variable (computer science). --- Variable (mathematics). --- Variational inequality. --- Variational principle. --- Without loss of generality. --- Worst-case complexity. --- Yurii Nesterov. --- Mathematical Optimization --- Mathematics --- Programming (mathematics)