scientific article; zbMATH DE number 5041059
From MaRDI portal
Publication:5478968
zbMath1105.90356MaRDI QIDQ5478968
Publication date: 14 July 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On applications of the calmness moduli for multifunctions to error bounds, A Lipschitzian error bound for convex quadratic symmetric cone programming, Weak sharp efficiency in multiobjective optimization, Sharp minima for multiobjective optimization in Banach spaces, Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, Characterizations of stability of error bounds for convex inequality constraint systems, Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems, Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, Linear conditioning, weak sharpness and finite convergence for equilibrium problems, Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization, New characterizations of weak sharp minima, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, Set regularities and feasibility problems, The equivalence of three types of error bounds for weakly and approximately convex functions, Strong Fermat rules for constrained set-valued optimization problems on Banach spaces, On the variational behaviour of functions with positive steepest descent rate, Level sets relaxation, epigraphical relaxation and conditioning in optimization, About error bounds in metrizable topological vector spaces, Generalized weak sharp minima in cone-constrained convex optimization with applications, Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming, Strong KKT conditions and weak sharp solutions in convex-composite optimization, Weak sharp minima in set-valued optimization problems, Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces, Ekeland's variational principle for interval-valued functions, Necessary conditions for weak sharp minima in cone-constrained optimization problems, Global error bounds for piecewise convex polynomials, Minimum recession-compatible subsets of closed convex sets, Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity, Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property, Global error bounds for \(\gamma \)-paraconvex multifunctions, Weak \(\psi \)-sharp minima in vector optimization problems, Unnamed Item, Metric subregularity for proximal generalized equations in Hilbert spaces, Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity, Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance, Finite termination of the proximal point algorithm in Banach spaces, Sufficient conditions for error bounds and linear regularity in Banach spaces, Finite convergence of the proximal point algorithm for variational inequality problems, Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass, Finite termination of inexact proximal point algorithms in Hilbert spaces, Global weak sharp minima for convex (semi-)infinite optimization problems, Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty, About subtransversality of collections of sets, Slopes, error bounds and weak sharp Pareto minima of a vector-valued map, Strong Abadie CQ, ACQ, calmness and linear regularity, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions, Error bounds for systems of lower semicontinuous functions in Asplund spaces, Metric subregularity for composite-convex generalized equations in Banach spaces, Metric subregularity for nonclosed convex multifunctions in normed spaces, Weak sharp minima for set-valued vector variational inequalities with an application, Error bounds: necessary and sufficient conditions, Subsmooth semi-infinite and infinite optimization problems, About regularity of collections of sets, Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, A note on finite termination of iterative algorithms in mathematical programming, Sharpness, Restart, and Acceleration, Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories, Faster subgradient methods for functions with Hölderian growth, Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems, On convergence of the proximal point algorithm in Banach spaces, Moduli of regularity and rates of convergence for Fejér monotone sequences, Convergence rates of subgradient methods for quasi-convex optimization problems, Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination, Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints, Weak sharpness and finite termination for variational inequalities on Hadamard manifolds, Weak sharp minima revisited. II: Application to linear regularity and error bounds, Calmness of constraint systems with applications
