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 ⋮ Large-scale optimization with the primal-dual column generation method ⋮ On the problem polyhedral separability: a numerical solution ⋮ Bounded and almost periodic solutions of convex Lagrangian systems. ⋮ Decomposition algorithm for large-scale two-stage unit-commitment ⋮ A bundle method using two polyhedral approximations of the $\epsilon $-enlargement of a maximal monotone operator ⋮ Strong convergence of hybrid Halpern iteration for Bregman totally quasi-asymptotically nonexpansive multi-valued mappings in reflexive Banach spaces with application ⋮ Strong convergence theorem for quasi-Bregman strictly pseudocontractive mappings and equilibrium problems in Banach spaces ⋮ On iterative computation of fixed points and optimization ⋮ Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints ⋮ An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping ⋮ Using the eigenvalue relaxation for binary least-squares estimation problems ⋮ A proximal method for identifying active manifolds ⋮ A free boundary approach to the Rosensweig instability of ferrofluids ⋮ A note on computing the smallest conic singular value ⋮ Epi-convergence: the Moreau envelope and generalized linear-quadratic functions ⋮ On solving the Lagrangian dual of integer programs via an incremental approach ⋮ Best practices for comparing optimization algorithms ⋮ Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions ⋮ Lagrangian relaxation for SVM feature selection ⋮ Lagrange-type duality in DC programming problems with equivalent DC inequalities ⋮ A note on the Morozov principle via Lagrange duality ⋮ Positively homogeneous functions revisited ⋮ Maximal closure on a graph with resource constraints ⋮ IQC analysis and synthesis via nonsmooth optimization ⋮ Farkas-type results for max-functions and applications ⋮ Sparse estimation of high-dimensional correlation matrices ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ A quasi-second-order proximal bundle algorithm ⋮ Strong convergence theorem for Bregman strongly nonexpansive mappings and equilibrium problems in reflexive Banach spaces ⋮ Lower and upper bounds for the spanning tree with minimum branch vertices ⋮ A stochastic model for risk management in global supply chain networks ⋮ Quasi-concave density estimation ⋮ Extremality of convex sets with some applications ⋮ A method for convex minimization based on translated first-order approximations ⋮ On some geometric conditions for minimality of DCH-functions via DC-duality approach

This page was built for publication: