scientific article; zbMATH DE number 439380
From MaRDI portal
Publication:3141900
zbMATH Open0795.49001MaRDI QIDQ3141900FDOQ3141900
Authors: Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal 
Publication date: 1 November 1993
Title of this publication is not available (Why is that?)
Recommendations
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25) Convex functions and convex programs in convex geometry (52A41) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Cited In (only showing first 100 items - show all)
- Margins on short sales and equilibrium price indeterminacy
- Convex analysis of invariant sets for a class of nonlinear systems
- Team optimization problems with Lipschitz continuous strategies
- Nonconvex integration using \(\varepsilon\)-subdifferentials
- General solution procedures in elasto/viscoplasticity
- Using enclosing ellipsoids in multiaxial fatigue strength criteria
- Numerical identification of parameters for a strongly degenerate convection-diffusion problem modelling centrifugation of flocculated suspensions
- Extensions of Gauss quadrature via linear programming
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- On embedding the volume algorithm in a variable target value method.
- Codifferential method for minimizing nonsmooth DC functions
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- Robust capacity assignment in telecommunications
- Minimizing Piecewise-Concave Functions Over Polyhedra
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- Convexity and generalized second-order derivatives for locally Lipschitz functions
- Benefit sharing in holding situations
- Adaptive minimax testing in the discrete regression scheme
- Convex and set-valued analysis. Selected topics
- Study of semilocal convergence analysis of Chebyshev's method under new type majorant conditions
- On the dual representation of coherent risk measures
- Approximations of Lovász extensions and their induced interaction index
- Relative utility bounds for empirically optimal portfolios
- Undergraduate convexity. From Fourier and Motzkin to Kuhn and Tucker
- Global weak sharp minima for convex (semi-)infinite optimization problems
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- On constraint qualifications of a nonconvex inequality
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- On approximate solutions for robust convex semidefinite optimization problems
- A control problem arising in the process of waste water purification
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- On representer theorems and convex regularization
- Uniform tree approximation by global optimization techniques
- Undesirable facility location with minimal covering objectives
- Designing robustly stabilising controllers for LTI spatially distributed systems using coprime factor synthesis
- Lipschitz modulus in convex semi-infinite optimizationviad.c. functions
- Approximation Bounds for Sparse Programs
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Semidefinite programming and combinatorial optimization
- Periodic solutions of evolution variational inequalities - a method of guiding functions
- Alternance form of optimality conditions in the finite-dimensional space
- Sequential formulae for the normal cone to sublevel sets
- Convex constrained programmes with unattained infima
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- New formulas for the Legendre-Fenchel transform.
- A unifying approach to isotropic and anisotropic total variation denoising models
- Representation complexity of adaptive 3D distance fields
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- Interior-point methods with decomposition for solving large-scale linear programs
- A consistent approach to continuum and discrete rate elastoplastic structural problems
- Subcalculus for set functions and cores of TU games.
- On the equivalence of optimality design criteria for the placebo--treatment problem
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- Global efficiency for multiobjective bilevel programming problems under generalized invexity
- Bounds for global optimization of capacity expansion and flow assignment problems
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Differentiable McCormick relaxations
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- Gap functions for quasi-equilibria
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- New results on \(k\)-independence of graphs
- Inexact accelerated augmented Lagrangian methods
- Accelerated training of max-margin Markov networks with kernels
- Potentials for the modified Cam-Clay model
- Two numerical methods for optimizing matrix stability
- Regularizations for stochastic linear variational inequalities
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
- Approximations in proximal bundle methods and decomposition of convex programs
- A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics
- Asymptotics of the maximal radius of an \(L^{r}\)-optimal sequence of quantizers
- An efficient DC programming approach for portfolio decision with higher moments
- Directed subdifferentiable functions and the directed subdifferential without delta-convex structure
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Reformulations of measure differential inclusions and their closed graph property
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- A multifield variational formulation of viscoplasticity suitable to deal with singularities and non-smooth functions
- Numerical solution of an adhesion problem with FEM and BEM
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- An approximate decomposition algorithm for convex minimization
- On minimax-regret Huff location models
- Optimization of the norm of a vector-valued DC function and applications
- The globalization theorem for the curvature-dimension condition
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Integrated capacity and inventory management with capacity acquisition lead times
- Residuala posteriori error estimators for contact problems in elasticity
- Constrained iterations for blind deconvolution and convexity issues
- The strong conical hull intersection property for convex programming
- Mathematical programming models and algorithms for engineering design optimization
- Regularization methods for optimization problems with probabilistic constraints
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- Remarks on converse Carleman and Krein criteria for the classical moment problem
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Minkowski’s inequality for two variable difference means
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- A sensitivity analysis of a class of semi-coercive variational inequalities using recession tools
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141900)
