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)
- On the proximal gradient algorithm with alternated inertia
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- A Method for Minimization of Quasidifferentiable Functions
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- On first order optimality conditions for vector optimization
- Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
- No arbitrage conditions and liquidity
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Algorithms for the quasiconvex feasibility problem
- An efficient algorithm for second-order cone linear complementarity problems
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Approximating stationary points of stochastic optimization problems in Banach space
- Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Learning sparse gradients for variable selection and dimension reduction
- Existence and stability of exact penalty for optimization problems with mixed constraints
- Inexact proximal Newton methods for self-concordant functions
- A nonsmooth Newton method for elastoplastic problems
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- On boundedness of (quasi-)convex integer optimization problems
- The space decomposition theory for a class of eigenvalue optimizations
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Finite dimensional convexity and optimization
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Conditioning and regularization of nonsymmetric operators
- Canonical factorization of continuous functions on the $d$-torus
- Almost periodic solutions of second-order systems with monotone fields on a compact subset.
- On infeasibility of systems of convex analytic inequalities
- Convergence analysis of gradient descent stochastic algorithms
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- A spatial regularization approach for vector quantization
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- On a sufficient condition for weak sharp efficiency in multiobjective optimization
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- A proximal gradient descent method for the extended second-order cone linear complementarity problem
- A unified approach to convex and convexified generalized differentiation of nonsmooth functions and set-valued mappings
- Implicit yield function formulation for granular and rock-like materials
- The distance between two convex sets
- Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition
- On a solving bilevel d.c.-convex optimization problems
- Iteration complexity analysis of block coordinate descent methods
- A framework of discrete DC programming by discrete convex analysis
- An exact cooperative method for the uncapacitated facility location problem
- Reverse propagation of McCormick relaxations
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Metric regularity and optimality conditions in nonsmooth optimization
- A perturbation approach for an inverse quadratic programming problem
- On equivalent equilibrium problems
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Optimization tools for solving equilibrium problems with nonsmooth data
- Nonparametric estimation by convex programming
- Test configurations, large deviations and geodesic rays on toric varieties
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- Exact conic programming relaxations for a class of convex polynomial cone programs
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Robust global error bounds for uncertain linear inequality systems with applications
- Interpolation in the Nevanlinna and Smirnov classes and harmonic majorants
- A space decomposition scheme for maximum eigenvalue functions and its applications
- A generalization of Löwner-John's ellipsoid theorem
- Semi-obnoxious location models: A global optimization approach
- A new series of conjectures and open questions in optimization and matrix analysis
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- 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
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)
