Pages that link to "Item:Q1235956"

The following pages link to Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures (Q1235956):

Displaying 50 items.

• Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity (Q262553) (← links)
• Weak sharp efficiency in multiobjective optimization (Q315498) (← links)
• The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995) (← links)
• Strict global minimizers and higher-order generalized strong invexity in multiobjective optimization (Q389136) (← links)
• Conic positive definiteness and sharp minima of fractional orders in vector optimization problems (Q412473) (← links)
• Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
• Variational analysis on local sharp minima via exact penalization (Q505627) (← links)
• Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method (Q633953) (← links)
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
• Subsmooth semi-infinite and infinite optimization problems (Q715070) (← links)
• A unified theory of strong uniqueness in uniform approximation with constraints (Q787045) (← links)
• Convergence analysis of the general Gauss-Newton algorithm (Q796257) (← links)
• Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
• Local strong uniqueness (Q908459) (← links)
• Higher-order optimality conditions for strict local minima (Q940860) (← links)
• Global weak sharp minima for convex (semi-)infinite optimization problems (Q950495) (← links)
• Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives (Q1018687) (← links)
• The prevalence of strong uniqueness in \(L^ 1\) (Q1108516) (← links)
• Strong uniqueness and second order convergence in nonlinear discrete approximation (Q1164952) (← links)
• On the convergence of a class of nonlinear approximation methods (Q1169786) (← links)
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
• Strong uniqueness, Lipschitz continuity, and continuous selections for metric projections in \(L_1\) (Q1176142) (← links)
• A projected conjugate gradient method for sparse minimax problems (Q1315210) (← links)
• Characterizations of strict local minima and necessary conditions for weak sharp minima (Q1321486) (← links)
• Approximation in normed linear spaces (Q1587393) (← links)
• Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs (Q1754722) (← links)
• A review of the parameter estimation problem of fitting positive exponential sums to empirical data (Q1855142) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
• TILT: transform invariant low-rank textures (Q1931595) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories (Q2047201) (← links)
• Linear conditioning, weak sharpness and finite convergence for equilibrium problems (Q2176285) (← links)
• Existence of pseudo-relative sharp minimizers in set-valued optimization (Q2234314) (← links)
• Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions (Q2266355) (← links)
• A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization (Q2484629) (← links)
• Robust low transformed multi-rank tensor methods for image alignment (Q2660687) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization (Q2693835) (← links)
• Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives (Q3514837) (← links)
• Sufficient Conditions of Isolated Minimizers for Constrained Programming Problems (Q3590040) (← links)
• Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120) (← links)
• Local properties of inexact methods for minimizing nonsmooth composite functions (Q3760305) (← links)
• Characterizations of strict local minima for some nonlinear programming problems (Q4378794) (← links)
• A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case (Q4495013) (← links)
• (Q4553953) (← links)
• Isolated efficiency in nonsmooth semi-infinite multi-objective programming (Q4646538) (← links)
• Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity (Q4987692) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)