scientific article

Nguyen Mau Nam, Boris S. Mordukhovich

Publication date: 22 January 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimization convex analysis subdifferential calculus

Convex programming (90C25) Applications of mathematical programming (90C90) Nonsmooth analysis (49J52) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items

On duality gap with polynomial multipliers for polynomial optimization problems, Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors, The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems, Solving a continuous multifacility location problem by DC algorithms, Retracted article: Hermite-Hadamard-type inequalities for \(\eta_h\)-convex functions via \(\psi\)-Riemann-Liouville fractional integrals, Quasi-relative interiors for graphs of convex set-valued mappings, On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces, On some fractional integral inequalities for generalized strongly modified \(h\)-convex functions, On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings, Market equilibria and money, Subdifferential stability analysis for convex optimization problems via multiplier sets, Second-order cone programming relaxations for a class of multiobjective convex polynomial problems, Algebraic core and convex calculus without topology, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, Regularizing with Bregman--Moreau Envelopes, Unnamed Item, Convex analysis of minimal time and signed minimal time functions, Approximations for Pareto and proper Pareto solutions and their KKT conditions, Finite-Time Stability of Polyhedral Sweeping Processes with Application to Elastoplastic Systems, A Vectorization Scheme for Nonconvex Set Optimization Problems, Minimizing differences of convex functions with applications to facility location and clustering, Extremality of convex sets with some applications, On Douglas-Rachford operators that fail to be proximal mappings, Duality results for nonlinear single minimax location problems via multi-composed optimization, Optimization of Mayer functional in problems with discrete and differential inclusions and viability constraints, Differential stability of discrete optimal control problems with possibly nondifferentiable costs, New criteria for dissipativity analysis of fractional-order static neural networks, Characterizing robust local error bounds for linear inequality systems under data uncertainty, A parameterized Douglas-Rachford algorithm, A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance, Second order analysis for robust inclusion systems and applications, Book review of: B. S. Mordukhovich and N. M. Nam, Convex analysis and beyond. Volume I. Basic theory, Optimality Conditions for E-Convex Interval-Valued Programming Problem Using gH-Symmetrical Derivative, Unnamed Item, Unnamed Item, Finite-time stability of any polyhedral sweeping process with uni-directional loading and application to elastoplastic models, Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications, A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality, Robust error bounds for uncertain convex inequality systems with applications, A globally convergent proximal Newton-type method in nonsmooth convex optimization, On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty, Nonlinear evolution equation associated with hypergraph Laplacian, Robust second order cone conditions and duality for multiobjective problems under uncertainty data, Robust global error bounds for uncertain linear inequality systems with applications, Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs, Unnamed Item, Smoothing techniques and difference of convex functions algorithms for image reconstructions, Unnamed Item, A Continuation Principle for Periodic BV-Continuous State-Dependent Sweeping Processes, Convergent conic linear programming relaxations for cone convex polynomial programs, On the convexity of piecewise-defined functions, A unified approach to convex and convexified generalized differentiation of nonsmooth functions and set-valued mappings, Closed convex sets with an open or closed Gauss range, Minsum location extended to gauges and to convex sets, Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications, On a convex set with nondifferentiable metric projection, Facility location in normed linear spaces, A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals, Semidefinite program duals for separable polynomial programs involving box constraints, Clustering and multifacility location with constraints via distance function penalty methods and dc programming, Variational geometric approach to generalized differential and conjugate calculi in convex analysis, A new notion of error bounds: necessary and sufficient conditions, Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique, A novel convex clustering method for high-dimensional data using semiproximal ADMM, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, Unnamed Item, Generalized Farkas lemma with adjustable variables and two-stage robust linear programs, A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints, Solving \(k\)-center problems involving sets based on optimization techniques, Minimal time function with respect to a set of directions: basic properties and applications, Second-order viability problems for differential inclusions with endpoint constraint and duality, Directional Pareto efficiency: concepts and optimality conditions, Optimization of higher-order differential inclusions with special boundary value conditions, Unnamed Item, Bilateral exchange and competitive equilibrium