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
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, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, ON ARITHMETIC SUMS OF CONNECTED SETS IN, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, A Path-Based Approach to Constrained Sparse Optimization, Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors, Estimating directional returns to scale in DEA, Cycle symmetry, limit theorems, and fluctuation theorems for diffusion processes on the circle, A study of multivalued variational inequalities via horizon maps and graphical convergence, Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems, Entropic Regularization of the ℓ 0 Function, Computing on Lattice-Ordered Abelian Groups, Convergence results for a self-dual regularization of convex problems, KL-optimum designs: theoretical properties and practical computation, New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions, Structured Sparsity: Discrete and Convex Approaches, Unnamed Item, A Cone-Continuity Constraint Qualification and Algorithmic Consequences, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination, On Single-Valuedness of Quasimonotone Set-Valued Operators, Discretizing Distributions with Exact Moments: Error Estimate and Convergence Analysis, Unnamed Item, Regularizing with Bregman--Moreau Envelopes, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, Unnamed Item, On an irreversible investment problem with two-factor uncertainty, The Bregman Proximal Average, Spectrally optimized pointset configurations, Qualification Conditions in Semialgebraic Programming, Convex analysis in groups and semigroups: a sampler, Submodular functions: from discrete to continuous domains, Stoichiometric and dynamical autocatalysis for diluted chemical reaction networks, Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Multifidelity Robust Controller Design with Gradient Sampling, Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions, THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE, A projected Newton algorithm for the dual convex program of elastoplasticity, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, Unnamed Item, On the shape-preserving properties of \(\lambda\)-Bernstein operators, Recent progress on integrally convex functions, Book review of: B. S. Mordukhovich and N. M. Nam, Convex analysis and beyond. Volume I. Basic theory, Derivation of coordinate descent algorithms from optimal control theory, Characterization of polynomials whose large powers have all positive coefficients, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods, A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming, Computation of the maximum likelihood estimator in low-rank factor analysis, Convex analysis in normed spaces and metric projections onto convex bodies, A one-dimensional computational model for hyperelastic string structures with Coulomb friction, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Two-stage time-optimal formation reconfiguration strategy, Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis, Risk measuring under liquidity risk, METRIC REGULARITY—A SURVEY PART 1. THEORY, METRIC REGULARITY—A SURVEY PART II. APPLICATIONS, Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization, Constrained L2-Approximation by Polynomials on Subsets of the Circle, Multi-valued, singular stochastic evolution inclusions, On Decomposition Models in Imaging Sciences and Multi-time Hamilton--Jacobi Partial Differential Equations, Stability in generalized differentiability based on a set convergence principle, Unnamed Item, Constrained extremal problems in $H^2$ and Carleman's formulae, Unnamed Item, Proximal Distance Algorithms: Theory and Examples, Solving Thurston's equation in a commutative ring, About optimal harvesting policies for a multiple species forest without discounting, Delegated information acquisition with moral hazard, NEAREST POINTS AND DELTA CONVEX FUNCTIONS IN BANACH SPACES, Structured sparsity through convex optimization, Convex Hulls of Algebraic Sets, A Data-Independent Distance to Infeasibility for Linear Conic Systems, Robustness of learning algorithms using hinge loss with outlier indicators, Towards a deeper geometric, analytic and algorithmic understanding of margins, Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, CHECKERBOARD COPULAS OF MAXIMUM ENTROPY WITH PRESCRIBED MIXED MOMENTS, Unnamed Item, An Algorithm for Unconstrained Quadratically Penalized Convex Optimization, Abstract convergence theorem for quasi-convex optimization problems with applications, Efficient Advert Assignment, A Fenchel-Moreau-Rockafellar type theorem on the Kantorovich-Wasserstein space with applications in partially observable Markov decision processes, Duality for Optimization Problems with Infinite Sums, RELAXED UTILITY MAXIMIZATION IN COMPLETE MARKETS, Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, An image sharpening operator combined with framelet for image deblurring, Error Analysis for Probabilities of Rare Events with Approximate Models, Unnamed Item, Optimality of SVM: novel proofs and tighter bounds, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, A Doubly Graduated Method for Inference in Markov Random Field, Unnamed Item, Greedy approximation in convex optimization, Tropical spectral theory of tensors, Bilevel Methods for Image Reconstruction, On Carathéodory Quasilinear Functionals for BV Functions and Their Time Flows for a Dual $$ H^{1}$$ Penalty Model for Image Restoration, CONORBIT: constrained optimization by radial basis function interpolation in trust regions, Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design
