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)- 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
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- A nonsmooth Newton method for elastoplastic problems
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- Robust global error bounds for uncertain linear inequality systems with applications
- Existence and stability of exact penalty for optimization problems with mixed constraints
- Test configurations, large deviations and geodesic rays on toric varieties
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Metric regularity and optimality conditions in nonsmooth optimization
- Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Almost periodic solutions of second-order systems with monotone fields on a compact subset.
- A space decomposition scheme for maximum eigenvalue functions and its applications
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- On a solving bilevel d.c.-convex optimization problems
- A perturbation approach for an inverse quadratic programming problem
- On equivalent equilibrium problems
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- A unified approach to convex and convexified generalized differentiation of nonsmooth functions and set-valued mappings
- Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines
- Optimization tools for solving equilibrium problems with nonsmooth data
- Algorithms for the quasiconvex feasibility problem
- On first order optimality conditions for vector optimization
- Implicit yield function formulation for granular and rock-like materials
- Iteration complexity analysis of block coordinate descent methods
- On infeasibility of systems of convex analytic inequalities
- On boundedness of (quasi-)convex integer optimization problems
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- 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
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- Learning sparse gradients for variable selection and dimension reduction
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- The space decomposition theory for a class of eigenvalue optimizations
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- Approximating stationary points of stochastic optimization problems in Banach space
- Extensions of Gauss quadrature via linear programming
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Bounds for global optimization of capacity expansion and flow assignment problems
- Subcalculus for set functions and cores of TU games.
- New formulas for the Legendre-Fenchel transform.
- Robust capacity assignment in telecommunications
- A unifying approach to isotropic and anisotropic total variation denoising models
- A consistent approach to continuum and discrete rate elastoplastic structural problems
- 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
- Nonconvex integration using \(\varepsilon\)-subdifferentials
- Convex and set-valued analysis. Selected topics
- Sequential formulae for the normal cone to sublevel sets
- General solution procedures in elasto/viscoplasticity
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Study of semilocal convergence analysis of Chebyshev's method under new type majorant conditions
- Convex constrained programmes with unattained infima
- Global weak sharp minima for convex (semi-)infinite optimization problems
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- Semidefinite programming and combinatorial optimization
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Using enclosing ellipsoids in multiaxial fatigue strength criteria
- Designing robustly stabilising controllers for LTI spatially distributed systems using coprime factor synthesis
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Approximation Bounds for Sparse Programs
- Margins on short sales and equilibrium price indeterminacy
- On embedding the volume algorithm in a variable target value method.
- On the dual representation of coherent risk measures
- Lipschitz modulus in convex semi-infinite optimizationviad.c. functions
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)
