scientific article; zbMATH DE number 477581

zbMath0795.49002MaRDI QIDQ4273942

Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal

Publication date: 8 December 1993

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

Mathematics Subject Classification ID

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

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, Homogenization of a parabolic model of ferromagnetism, Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function, An effective nonsmooth optimization algorithm for locally Lipschitz functions, A trust region method for the solution of the surrogate dual in integer programming, Error bound results for convex inequality systems via conjugate duality, Global error bounds for piecewise convex polynomials, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics., A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation, On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems, An infeasible-point subgradient method using adaptive approximate projections, Optimality conditions in terms of alternance: two approaches, Homogenization of nonlinear visco-elastic composites, Formulae for the conjugate and the subdifferential of the supremum function, Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence, Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment, A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings, A generalization of Löwner-John's ellipsoid theorem, Diagonal bundle method for nonsmooth sparse optimization, On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data, The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces, Hamilton-Jacobi equations on graph and applications, Variational geometric approach to generalized differential and conjugate calculi in convex analysis, Dynamic smoothness parameter for fast gradient methods, A duality approach for a class of semivectorial bilevel programming problems, Differentiable McCormick relaxations, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, Two approaches to stochastic optimal control problems with a final-time expectation constraint, Proximity search for 0--1 mixed-integer convex programming, An adaptive competitive penalty method for nonsmooth constrained optimization, \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints, Halpern's iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces, An inexact spectral bundle method for convex quadratic semidefinite programming, Templates for convex cone problems with applications to sparse signal recovery, Fixed point and Bregman iterative methods for matrix rank minimization, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A steepest descent method for vector optimization, Noisy Euclidean distance matrix completion with a single missing node, Nonsmooth optimization: Theory and algorithms, Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Refined optimality conditions for differences of convex functions, Smoothing methods for nonsmooth, nonconvex minimization, A new trust region algorithm for nonsmooth convex minimization, Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems, An effective adaptive trust region algorithm for nonsmooth minimization, Cramér transform and \(t\)-entropy, Minimizers of Dirichlet functionals on the \(n\)-torus and the weak KAM theory, Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping, Direct approach to the minimization of the maximal stress over an arch structure, Overcoming the curse of dimensionality for some Hamilton-Jacobi partial differential equations via neural network architectures, Stabilized column generation, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, Nonsmooth bundle trust-region algorithm with applications to robust stability, Strong convergence results of two-steps modifying Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application, About Lagrangian methods in integer optimization, 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, Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems, New constraint qualification and conjugate duality for composed convex optimization problems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Can we trust the bootstrap in high-dimension?, Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality, An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators, Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application, High-order total variation regularization approach for axially symmetric object tomography from a single radiograph, Ergodic convergence in subgradient optimization, ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps, Adaptive methods for solvings minimax problems^∗, Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems, Separable convexification and DCA techniques for capacity and flow assignment problems, Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions, A new family of penalties for augmented Lagrangian methods, Gradient constitutive relations: numerical aspects and application to gradient damage, Farkas-type results for inequality systems with composed convex functions via conjugate duality, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Proximal bundle methods for nonsmooth DC programming, A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract, Modified inertial subgradient extragradient method in reflexive Banach spaces, Comparison principle for Hamilton-Jacobi-Bellman equations via a bootstrapping procedure, Characterizations of solution sets of convex vector minimization problems, Some Applications of Optimal Control Theory of Distributed Systems, On the equivalence between complementarity systems, projected systems and differential inclusions, Pairs of positive solutions for nonlinear elliptic equations with the \(p\)-Laplacian and a nonsmooth potential, On methods for converting exhausters of positively homogeneous functions, Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets, Management of wind power variations in electricity system investment models. A parallel computing strategy, Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs, Collaborative Total Variation: A General Framework for Vectorial TV Models, A notion of compliance robustness in topology optimization, Nesterov's algorithm solving dual formulation for compressed sensing, Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing, Fixed-structure robust controller design for chatter mitigation in high-speed milling, Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions, Regularized gap functions for variational problems, Dual Inequalities for Stabilized Column Generation Revisited, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A unifying framework for several cutting plane methods for semidefinite programming, New global optimality conditions for nonsmooth DC optimization problems, Duality and Approximation of Stochastic Optimal Control Problems under Expectation Constraints, On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations, Iterative approximations of attractive point of a new generalized Bregman nonspreading mapping in Banach spaces, A feasibility-ensured Lagrangian heuristic for general decomposable problems, Differential stability properties in convex scalar and vector optimization, Efficient proximal mapping computation for low-rank inducing norms, Subgradient and Bundle Methods for Nonsmooth Optimization, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time, Continuous outer subdifferentials in nonsmooth optimization, BV solutions and viscosity approximations of rate-independent systems, Strong convergence theorems for quasi-Bregman nonexpansive mappings in reflexive Banach spaces, Adaptive minimax testing in the discrete regression scheme, A strong convergence theorem for solving an equilibrium problem and a fixed point problem using the Bregman distance, Outer approximation for mixed-integer nonlinear robust optimization, Improved local convergence analysis of the Gauss-Newton method under a majorant condition, Revisiting augmented Lagrangian duals, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Support vector machine polyhedral separability in semisupervised learning, Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification