scientific article; zbMATH DE number 439380
From MaRDI portal
Publication:3141900
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- A sensitivity analysis of a class of semi-coercive variational inequalities using recession tools
- Constrained iterations for blind deconvolution and convexity issues
- Inexact accelerated augmented Lagrangian methods
- Remarks on converse Carleman and Krein criteria for the classical moment problem
- Accelerated training of max-margin Markov networks with kernels
- A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics
- Differences of polyhedra in matrix space and their applications to nonsmooth analysis
- 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
- Reformulations of measure differential inclusions and their closed graph property
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Numerical implementation of two nonconforming finite element methods for unilateral contact
- Minkowski’s inequality for two variable difference means
- Residuala posteriori error estimators for contact problems in elasticity
- Numerical solution of an adhesion problem with FEM and BEM
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Potentials for the modified Cam-Clay model
- An approximate decomposition algorithm for convex minimization
- On minimax-regret Huff location models
- Asymptotics of the maximal radius of an \(L^{r}\)-optimal sequence of quantizers
- An efficient DC programming approach for portfolio decision with higher moments
- 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
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- Positively homogeneous functions revisited
- A variational approach of the rank function
- A multifield variational formulation of viscoplasticity suitable to deal with singularities and non-smooth functions
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- Liquidity risks on power exchanges: a generalized Nash equilibrium model
- A trust region method for solving semidefinite programs
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- A feasible directions method for nonsmooth convex optimization
- Two numerical methods for optimizing matrix stability
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
- The strong conical hull intersection property for convex programming
- Integrated capacity and inventory management with capacity acquisition lead times
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- Minimizing and stationary sequences of convex constrained minimization problems
- Second-order directional derivatives of all eigenvalues of a symmetric matrix
- Mathematical programming models and algorithms for engineering design optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples
- A Lagrangean heuristic for the facility location problem with staircase costs
- Directed subdifferentiable functions and the directed subdifferential without delta-convex structure
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Regularization methods for optimization problems with probabilistic constraints
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Representation of the Clarke generalized Jacobian via the quasidifferential
- Considering copositivity locally
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Optimization of the norm of a vector-valued DC function and applications
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- On computing the Mordukhovich subdifferential using directed sets in two dimensions
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Regularizations for stochastic linear variational inequalities
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- An inexact bundle variant suited to column generation
- Cutting angle methods in global optimization
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Graph-matrix calculus for computational convex analysis
- No arbitrage conditions and liquidity
- A proximal gradient descent method for the extended second-order cone linear complementarity problem
- The distance between two convex sets
- Semi-obnoxious location models: A global optimization approach
- 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
- A spatial regularization approach for vector quantization
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- Interpolation in the Nevanlinna and Smirnov classes and harmonic majorants
- A generalization of Löwner-John's ellipsoid theorem
- Convergence analysis of gradient descent stochastic algorithms
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A new series of conjectures and open questions in optimization and matrix analysis
- Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
- On the proximal gradient algorithm with alternated inertia
- An efficient algorithm for second-order cone linear complementarity problems
- Canonical factorization of continuous functions on the $d$-torus
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis
- On a sufficient condition for weak sharp efficiency in multiobjective optimization
- Finite dimensional convexity and optimization
- Nonparametric estimation by convex programming
- A Method for Minimization of Quasidifferentiable Functions
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Inexact proximal Newton methods for self-concordant functions
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Conditioning and regularization of nonsymmetric operators
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
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)
