scientific article; zbMATH DE number 439380
From MaRDI portal
Publication:3141900
Convexity of real functions of several variables, generalizations (26B25) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41) Numerical optimization and variational techniques (65K10) Convex programming (90C25)
Recommendations
Cited in
(only showing first 100 items - show all)- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Generalized Nash equilibrium problem, variational inequality and quasiconvexity
- First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization
- Convex ordered median problem with \(\ell _p\)-norms
- A geometric characterization of ``optimality-equivalent relaxations
- An inexact bundle variant suited to column generation
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Adjustment of an affine contract with a fixed-point iteration
- On the choice of explicit stabilizing terms in column generation
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Integrated capacity and inventory management with capacity acquisition lead times
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Periodic solutions of evolution variational inequalities - a method of guiding functions
- Conditional iterative proportional fitting for Gaussian distributions
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Feasible direction interior-point technique for nonlinear optimization
- A Lagrangean heuristic for the facility location problem with staircase costs
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity
- A bundle-Newton method for nonsmooth unconstrained minimization
- Semi-obnoxious location models: A global optimization approach
- On infeasibility of systems of convex analytic inequalities
- Convex constrained programmes with unattained infima
- Duality in D. C. programming: The case of several D. C. constraints
- Interior-point methods with decomposition for solving large-scale linear programs
- On \(\Phi\)-convexity of convex functions
- A nonsmooth Newton method for elastoplastic problems
- Finding the projection on a polytope: An iterative method
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Convergence analysis of gradient descent stochastic algorithms
- Conditioning and regularization of nonsymmetric operators
- A consistent approach to continuum and discrete rate elastoplastic structural problems
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Interpolation and approximation from convex sets
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Direct and dual theorems of Castigliano and Clapeyron for generalized elastic models
- Subcalculus for set functions and cores of TU games.
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Computing an obnoxious anchored segment.
- Norm-based approximation in multicriteria programming.
- Introductory lectures on convex optimization. A basic course.
- New formulas for the Legendre-Fenchel transform.
- The origins of quasi-concavity: a development between mathematics and economics.
- On first order optimality conditions for vector optimization
- Numerical implementation of two nonconforming finite element methods for unilateral contact
- Globally convergent BFGS method for nonsmooth convex optimization
- Minimal representation of convex regions defined by analytic functions
- Approximation of linear programs by Bregman's \(D_F\) projections
- An internal variable variational formulation of viscoplasticity
- Bounds for global optimization of capacity expansion and flow assignment problems
- Relations between enhanced strain methods and the HR method
- Two numerical methods for optimizing matrix stability
- Quadratic finite element methods for unilateral contact problems
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Saddle representations of positively homogeneous functions by linear functions
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- Best approximate solutions of inconsistent linear inequality systems
- On the dual representation of coherent risk measures
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- Perspective functions: properties, constructions, and examples
- A note on the Morozov principle via Lagrange duality
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- On a sufficient condition for weak sharp efficiency in multiobjective optimization
- Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis
- On approximate solutions for robust convex semidefinite optimization problems
- Abadie constraint qualifications for convex constraint systems and applications to calmness property
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- Dual method of centers for solving generalized fractional programs
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- On the local convergence analysis of the gradient sampling method for finite max-functions
- Global optimization for optimal power flow over transmission networks
- The equivariant Minkowski problem in Minkowski space
- Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities
- New diagonal bundle method for clustering problems in large data sets
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- Blocks of coordinates, stochastic programming, and markets
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- Lift expectations of random sets
- Convergence of first-order methods via the convex conjugate
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- A novel unified approach to invariance conditions for a linear dynamical system
- On sums and convex combinations of projectors onto convex sets
- An equivalent one level optimization problem to a semivectorial bilevel problem
- Visualizing data as objects by DC (difference of convex) optimization
- A negotiation-based algorithm to coordinate supplier development in decentralized supply chains
- On the proximal gradient algorithm with alternated inertia
- How to project onto extended second order cones
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A biobjective approach to recoverable robustness based on location planning
- A fast gradient and function sampling method for finite-max functions
- A convergence analysis of the method of codifferential descent
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
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)
