Convex analysis and nonlinear optimization. Theory and examples.
From MaRDI portal
Publication:817931
DOI10.1007/978-0-387-31256-9zbMath1116.90001OpenAlexW182881619MaRDI QIDQ817931
Adrian S. Lewis, Jonathan M. Borwein
Publication date: 20 March 2006
Published in: CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-31256-9
Convex programming (90C25) Applications of mathematical programming (90C90) Set-valued and variational analysis (49J53) Interior-point methods (90C51) Fixed-point theorems (47H10) Convex functions and convex programs in convex geometry (52A41) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Related Items (only showing first 100 items - show all)
Signomial and polynomial optimization via relative entropy and partial dualization ⋮ CTSVM: a robust twin support vector machine with correntropy-induced loss function for binary classification problems ⋮ Quasi-relative interiors for graphs of convex set-valued mappings ⋮ Convex optimization on Banach spaces ⋮ Discrete Fenchel duality for a pair of integrally convex and separable convex functions ⋮ Asymptotic analysis of an elastic material reinforced with thin fractal strips ⋮ On Abadie constraint qualification for multiobjective optimization problems ⋮ A convexity of functions on convex metric spaces of Takahashi and applications ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets ⋮ Apart sets and functions: an application to the stability of penalized optimization problems ⋮ Motzkin decomposition of closed convex sets ⋮ Deep solution operators for variational inequalities via proximal neural networks ⋮ Regularity of partial differential operators in ultradifferentiable spaces and Wigner type transforms ⋮ Dynamic costs and moral hazard: a duality-based approach ⋮ Inverse functions and existence principles ⋮ Regularity properties of non-negative sparsity sets ⋮ Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Maximal quasimonotonicity and dense single-directional properties of quasimonotone operators ⋮ Semicontinuous limits of nets of continuous functions ⋮ Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations ⋮ Screening for a reweighted penalized conditional gradient method ⋮ Matrix completion discriminant analysis ⋮ Characterization of polynomials whose large powers have fully positive coefficients ⋮ Checkerboard copula defined by sums of random variables ⋮ Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem ⋮ Quasi-concave density estimation ⋮ Nonlinear multilayered representation of graph-signals ⋮ Extremality of convex sets with some applications ⋮ Quadratic minimization with portfolio and intertemporal wealth constraints ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs ⋮ A sparsity regularization and total variation based computational framework for the inverse medium problem in scattering ⋮ Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces ⋮ The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces ⋮ Supervised distance preserving projection using alternating direction method of multipliers ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Learning in monotone Bayesian games ⋮ Efficient large deviation estimation based on importance sampling ⋮ The overdetermined Cauchy problem for \(\omega \)-ultradifferentiable functions ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Improvements by analyzing the efficient frontier in DEA ⋮ Online learning with stability guarantees: a memory-based warm starting for real-time MPC ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ The Gabor wave front set in spaces of ultradifferentiable functions ⋮ Right Bregman nonexpansive operators in Banach spaces ⋮ On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms ⋮ On the construction of minimum information bivariate copula families ⋮ Oracle inequalities and optimal inference under group sparsity ⋮ Riemannian convexity of functionals ⋮ A quantitative description of skyrmions in ultrathin ferromagnetic films and rigidity of degree \(\pm 1\) harmonic maps from \(\mathbb{R}^2\) to \(\mathbb{S}^2\) ⋮ Greedy expansions in convex optimization ⋮ A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem ⋮ Infinite-body optimal transport with Coulomb cost ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Barrier method in nonsmooth convex optimization without convex representation ⋮ On regularity of convex multifunctions ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ Stochastic variational inequalities on non-convex domains ⋮ A dual spectral projected gradient method for log-determinant semidefinite problems ⋮ Nearly Chebyshev sets are almost convex ⋮ On the mathematical foundations of the self-consistent clustering analysis for non-linear materials at small strains ⋮ On functionals with convex Carathéodory integrands with a linear growth condition ⋮ Variational geometric approach to generalized differential and conjugate calculi in convex analysis ⋮ Lagrange duality in set optimization ⋮ On smoothness properties of optimal value functions at the boundary of their domain under complete convexity ⋮ Dictionary descent in optimization ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ Improved subgradient extragradient methods for solving pseudomonotone variational inequalities in Hilbert spaces ⋮ The noncooperative transportation problem and linear generalized Nash games ⋮ Reachability analysis of nonlinear systems using hybridization and dynamics scaling ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ Copulas with maximum entropy ⋮ Distinguishability measures and entropies for general probabilistic theories ⋮ Salt and pepper noise removal based on an approximation of \(l_0\) norm ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ Klee sets and Chebyshev centers for the right Bregman distance ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ On the connectedness of spectral sets and irreducibility of spectral cones in Euclidean Jordan algebras ⋮ New closed-form bounds on the partition function ⋮ Simple bilevel programming and extensions ⋮ Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions ⋮ Transportation inequalities for Markov kernels and their applications ⋮ Geometry of polar wedges in Riesz spaces and super-replication prices in incomplete financial markets ⋮ Characterization of reflexivity by convex functions ⋮ Multipliers on \(\mathcal{S}_{\omega } (\mathbb{R}^N)\) ⋮ Optimality conditions for nonconvex problems over nearly convex feasible sets ⋮ Regularity and robustness in monotone Bayesian games ⋮ Bregman distances and Klee sets ⋮ Bregman distances and Chebyshev sets ⋮ A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems ⋮ Weakening convergence conditions of a potential reduction method for tensor complementarity problems ⋮ Generalized resilience and robust statistics ⋮ Hybrid non-convex regularizers model for removing multiplicative noise ⋮ A new mathematical formulation of the equations of perfect elasto-plasticity
This page was built for publication: Convex analysis and nonlinear optimization. Theory and examples.
