scientific article; zbMATH DE number 477581

Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal

Publication date: 8 December 1993

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

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items (only showing first 100 items - show all)

A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ Optimization under Rare Chance Constraints ⋮ Radius of Robust Feasibility for Mixed-Integer Problems ⋮ Differential stability of convex discrete optimal control problems with possibly empty solution sets ⋮ Unnamed Item ⋮ Fictitious domain/mixed finite element approach for a class of optimal shape design problems ⋮ Least-Squares Proper Generalized Decompositions for Weakly Coercive Elliptic Problems ⋮ ``FISTA in Banach spaces with adaptive discretisations ⋮ Error estimates of a theta-scheme for second-order mean field games ⋮ Profit sharing mechanisms in multi-owned cascaded hydrosystems ⋮ A constructive approach for computing the proximity operator of the $p$-th power of the $\ell_1$ norm ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ A version of bundle trust region method with linear programming ⋮ Towards Lower Bounds on the Depth of ReLU Neural Networks ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ Optimal Methods for Convex Risk-Averse Distributed Optimization ⋮ Approximation of Weak Efficient Solutions in Vector Optimization ⋮ Strong Convergence Theorem Obtained by a Generalized Projections Method for Solving an Equilibrium Problem and Fixed Point Problems ⋮ Unnamed Item ⋮ Polyhedral approximation of spectrahedral shadows via homogenization ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY ⋮ Hybrid inertial algorithm for fixed point and equilibrium problems in reflexive Banach spaces ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Unnamed Item ⋮ A simple modification of dantzig-wolfe decomposition ⋮ On Decomposition Models in Imaging Sciences and Multi-time Hamilton--Jacobi Partial Differential Equations ⋮ Unnamed Item ⋮ Whitney differentiability of optimal-value functions for bound-constrained convex programming problems ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ Unnamed Item ⋮ An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau ⋮ Multistage quadratic stochastic programming ⋮ The Lazy Travelling Salesman Problem in $\mathbb{R}^2$ ⋮ Techniques and Open Questions in Computational Convex Analysis ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ Bundle-based relaxation methods for multicommodity capacitated fixed charge network design ⋮ Computation of the distance to semi-algebraic sets ⋮ Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions ⋮ Minimal convex majorants of functions and Demyanov–Rubinov exhaustive super(sub)differentials ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Convergence theorems for equilibrium and fixed point problems ⋮ Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach ⋮ Causality theory for closed cone structures with applications ⋮ Differential stability of convex optimization problems under weaker conditions ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ A thermodynamically consistent model of a liquid-vapor fluid with a gas ⋮ Orthogonality in Generalized Minkowski Spaces ⋮ Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity ⋮ Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs ⋮ Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials ⋮ The method of codifferential descent for convex and global piecewise affine optimization ⋮ A Selective Linearization Method For Multiblock Convex Optimization ⋮ A new algorithm for solving mixed equilibrium problem and finding common fixed points of Bregman strongly nonexpansive mappings ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning ⋮ An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam ⋮ Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation ⋮ The stable duality of DC programs for composite convex functions ⋮ On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton-Jacobi partial differential equations ⋮ Comparing different nonsmooth minimization methods and software ⋮ Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities ⋮ Strict convex regularizations, proximal points and augmented lagrangians ⋮ Tuning strategy for the proximity parameter in convex minimization ⋮ A convergence theorem for solving generalized mixed equilibrium problems and finding fixed points of a weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ A subgradient method for multiobjective optimization ⋮ On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations ⋮ On $n$-polynomial $p$-convex functions and some related inequalities ⋮ Prices stabilization for inexact unit-commitment problems ⋮ Low-Rank Inducing Norms with Optimality Interpretations ⋮ On Hamilton-Jacobi PDEs and image denoising models with certain nonadditive noise ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Aubin property and uniqueness of solutions in cone constrained optimization ⋮ Optimal production and pricing strategies in a dynamic model of monopolistic firm ⋮ Asymptotic optimality in stochastic optimization ⋮ Convergence results for a common solution of a finite family of equilibrium problems and quasi-Bregman nonexpansive mappings in Banach space ⋮ Convergence theorem for common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings ⋮ Optimal rates of estimation for multi-reference alignment ⋮ Random moment problems under constraints ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Communication-efficient distributed multi-task learning with matrix sparsity regularization ⋮ On the penalized maximum likelihood estimation of high-dimensional approximate factor model ⋮ Multivariate coherent risk measures induced by multivariate convex risk measures ⋮ A simple version of bundle method with linear programming ⋮ Projective method of multipliers for linearly constrained convex minimization ⋮ On the risk of convex-constrained least squares estimators under misspecification ⋮ Differential stability of convex optimization problems with possibly empty solution sets ⋮ Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs ⋮ On the strong concavity of the dual function of an optimization problem ⋮ A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring ⋮ Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution ⋮ Ana posteriorierror analysis of adaptive finite element methods for distributed elliptic control problems with control constraints ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ On parallelizing dual decomposition in stochastic integer programming

This page was built for publication: