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)- Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity
- Solving \(k\)-center problems involving sets based on optimization techniques
- Representation of the Clarke generalized Jacobian via the quasidifferential
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- Accelerated training of max-margin Markov networks with kernels
- Inexact accelerated augmented Lagrangian methods
- On constraint qualifications in nonlinear programming
- The first variation of the total mass of log-concave functions and related inequalities
- Global optimization of bounded factorable functions with discontinuities
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Direct and dual theorems of Castigliano and Clapeyron for generalized elastic models
- On computing the Mordukhovich subdifferential using directed sets in two dimensions
- Some conjugation formulas and subdifferential formulas of convex analysis revisited
- Midpoint inequalities via strong convexity using positive weighted symmetry kernels
- A note on the Morozov principle via Lagrange duality
- On generalized strongly p-convex functions of higher order
- Graph-matrix calculus for computational convex analysis
- Convergence of a continuation method under majorant conditions
- On the proximal gradient algorithm with alternated inertia
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- A dual view of equilibrium problems
- Quadratic support functions in quadratic bilevel problems
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Potentials for the modified Cam-Clay model
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- Two numerical methods for optimizing matrix stability
- Error minimization with global optimization for difference of convex functions
- Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
- Regularizations for stochastic linear variational inequalities
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Short note on some geometric inequalities derived from matrix inequalities
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- Essentials of numerical nonsmooth optimization
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Nonconvex bundle method with application to a delamination problem
- A condition number theorem in convex programming
- Composite proximal bundle method
- SUSPECT: MINLP special structure detector for Pyomo
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- An efficient algorithm for the Euclidean \(r\)-centrum location problem
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Margins on short sales and equilibrium price indeterminacy
- Blocks of coordinates, stochastic programming, and markets
- Convergence of first-order methods via the convex conjugate
- Split Bregman method for large scale fused Lasso
- The first-order necessary conditions for sparsity constrained optimization
- On -solutions for robust fractional optimization problems
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Team optimization problems with Lipschitz continuous strategies
- Quasi-concave functions and convex convergence to infinity
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- Some assignment problems arising from multiple target tracking
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- Convex analysis of invariant sets for a class of nonlinear systems
- On local search in d.c. optimization problems
- Polyhedral approximation in mixed-integer convex optimization
- On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming
- New qualification conditions for convex optimization without convex representation
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Optimality and duality in nonsmooth composite vector optimization and applications
- Quasi-relative interiors for graphs of convex set-valued mappings
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- On a set-valued Young integral with applications to differential inclusions
- Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach
- Radius of robust global error bound for piecewise linear inequality systems
- The Brouwer fixed point theorem and periodic solutions of differential equations
- Using enclosing ellipsoids in multiaxial fatigue strength criteria
- Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators
- On strong and total Lagrange duality for convex optimization problems
- A stabilized structured Dantzig-Wolfe decomposition method
- Multiclass classification, information, divergence and surrogate risk
- Nonsmooth optimization via quasi-Newton methods
- \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem
- Optimality conditions for set optimization using a directional derivative based on generalized Steiner sets
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Approximations in proximal bundle methods and decomposition of convex programs
- Nonconvex integration using \(\varepsilon\)-subdifferentials
- Relations between enhanced strain methods and the HR method
- Statistics of robust optimization: a generalized empirical likelihood approach
- On perpetuities with light tails
- Caputo fractional derivative inequalities for refined modified \((h, m)\)-convex functions
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Extensions of Gauss quadrature via linear programming
- A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics
- Numerical identification of parameters for a strongly degenerate convection-diffusion problem modelling centrifugation of flocculated suspensions
- Sample average approximation of stochastic dominance constrained programs
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- General solution procedures in elasto/viscoplasticity
- Preprojective algebras and MV polytopes
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Asymptotics of the maximal radius of an \(L^{r}\)-optimal sequence of quantizers
- An efficient DC programming approach for portfolio decision with higher moments
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- An internal variable variational formulation of viscoplasticity
- On embedding the volume algorithm in a variable target value method.
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)
