Decreasing Functions with Applications to Penalization

From MaRDI portal
Publication:4943619

DOI10.1137/S1052623497326095zbMath0955.90127OpenAlexW2063529817MaRDI QIDQ4943619

No author found.

Publication date: 19 March 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497326095




Related Items

Numerical performance of penalty method for American option pricingAn M-objective penalty function algorithm under big penalty parametersCalmness and exact penalization in vector optimization with cone constraintsConvergence analysis of a class of penalty methods for vector optimization problems with cone constraintsExactness and algorithm of an objective penalty functionMultipliers and general LagrangiansA second-order smooth penalty function algorithm for constrained optimization problemsImage space analysis to Lagrange-type duality for constrained vector optimization problems with applicationsSecond-order analysis of penalty functionExistence of exact penalty for constrained optimization problems in Hilbert spacesSolving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approachUnified duality theory for constrained extremum problems. I: Image space analysisUnified duality theory for constrained extremum problems. II: Special duality schemesGlobal convergence of a class new smooth penalty algorithm for constrained optimization problemAn interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimizationConvergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditionsOn weak conjugacy, augmented Lagrangians and duality in nonconvex optimizationCalmness and exact penalization in vector optimization under nonlinear perturbationsAn approximate exact penalty in constrained vector optimization on metric spacesExact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraintsDuality for multiobjective optimization via nonlinear Lagrangian functionsA Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty MethodsA penalty approximation method for a semilinear parabolic double obstacle problemOn Smoothingl1Exact Penalty Function for Constrained Optimization ProblemsAn augmented Lagrangian approach with a variable transformation in nonlinear programmingUnified nonlinear Lagrangian approach to duality and optimal pathsExact augmented Lagrangian duality for mixed integer linear programmingConvergence analysis of a monotonic penalty method for American option pricingSecond-Order Smoothing Objective Penalty Function for Constrained Optimization ProblemsA unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactnessAn exact lower order penalty function and its smoothing in nonlinear programmingCritical dualityAn objective penalty function method for nonlinear programming.A penalty function method based on smoothing lower order penalty functionAbstract convexity for nonconvex optimization dualityExtended duality for nonlinear programmingPenalty functions with a small penalty parameterOn a modified subgradient algorithm for dual problems via sharp augmented LagrangianEfficiency and approachability of nonconvex bicriteria programsSmoothing Nonlinear Penalty Functions for Constrained Optimization ProblemsOn global optimality conditions via separation functionsExtended Lagrange and penalty functions in optimizationAugmented Lagrangian Objective Penalty FunctionLower-order penalization approach to nonlinear semidefinite programmingStrictly Increasing Positively Homogeneous Functions with Application to Exact PenalizationDuality and penalization in optimization via an augmented Lagrangian function with applicationsLower order calmness and exact penalty functionSome nonlinear Lagrange and penalty functions for problems with a single constraintModified Lagrangian and least root approaches for general nonlinear optimization problems