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)
- 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
- A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone
- The largest eigenvalue of a convex function, duality, and a theorem of Slodkowski
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Positively homogeneous functions revisited
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- A trust region method for solving semidefinite programs
- A variational approach of the rank function
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- Considering copositivity locally
- Differences of polyhedra in matrix space and their applications to nonsmooth analysis
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- Liquidity risks on power exchanges: a generalized Nash equilibrium model
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- A feasible directions method for nonsmooth convex optimization
- An inexact bundle variant suited to column generation
- Minimizing and stationary sequences of convex constrained minimization problems
- Second-order directional derivatives of all eigenvalues of a symmetric matrix
- Numerical implementation of two nonconforming finite element methods for unilateral contact
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- A Lagrangean heuristic for the facility location problem with staircase costs
- Cutting angle methods in global optimization
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Representation of the Clarke generalized Jacobian via the quasidifferential
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- On computing the Mordukhovich subdifferential using directed sets in two dimensions
- Graph-matrix calculus for computational convex analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- SUSPECT: MINLP special structure detector for Pyomo
- Nonconvex bundle method with application to a delamination problem
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Title not available (Why is that?)
- Composite proximal bundle method
- Split Bregman method for large scale fused Lasso
- The first-order necessary conditions for sparsity constrained optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- On \(\epsilon\)-solutions for robust fractional optimization problems
- On local search in d.c. optimization problems
- A stabilized structured Dantzig-Wolfe decomposition method
- Nonsmooth optimization via quasi-Newton methods
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Sample average approximation of stochastic dominance constrained programs
- Convex optimization theory.
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Decomposition algorithm for large-scale two-stage unit-commitment
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- On global search in nonconvex optimal control problems
- Affine processes on symmetric cones
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On numerical solving the spherical separability problem
- Quantifying repulsiveness of determinantal point processes
- The omnipresence of Lagrange
- Optimal learning with \textit{Q}-aggregation
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Affine processes on positive semidefinite matrices
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)
