Non-Linear Programming Via Penalty Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Existence of exact penalty and its stability for nonconvex constrained optimization problems in Banach spaces
- Partial exact penalty for mathematical programs with equilibrium constraints
- Exact penalty functions method for mathematical programming problems involving invex functions
- On smoothing exact penalty functions for nonlinear constrained optimization problems
- Global optimization on convex sets
- On the exactness of a class of nondifferentiable penalty functions
- A minimization method for the sum of a convex function and a continuously differentiable function
- A globally convergent algorithm for exact penalty functions
- Successive linearization methods for large-scale nonlinear programming problems
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Monotone mapping of similarities into a general metric space
- A note on the optimization of constrained design problems
- A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals
- Using sliding modes in static optimization and nonlinear programming
- Nonlinear programming solutions for controlling the vibration pattern of stretched strings
- An exact penalty function algorithm for solving general constrained parameter optimization problems
- Error bounds in mathematical programming
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- An objective penalty function-based method for inequality constrained minimization problem
- New exact penalty functions for nonlinear constrained optimization problems
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- An objective penalty function method for nonlinear programming.
- A power penalty method for second-order cone linear complementarity problems
- -optimality and duality for multiobjective fractional programming
- Weak via strong Stackelberg problem: New results
- The impelling function method applied to global optimization
- Iterative determination of parameters for an exact penalty function
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Exact barrier function methods for Lipschitz programs
- Global convergence of a class of smooth penalty methods for semi-infinite programming
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties
- Global minimization of constrained problems with discontinuous penalty functions
- Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
- An objective penalty function method for biconvex programming
- Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- A local search scheme for the inequality-constrained optimal control problem
- Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Benefits of noise in M-estimators: optimal noise level and probability density
- Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
- A combined penalty function and gradient projection method for nonlinear programming
- A local search method for optimization problem with d.c. inequality constraints
- An exact \(l_1\) penalty function method for multi-dimensional first-order PDE constrained control optimization problem
- Problems related to estimating the coefficients of exact penalty functions
- First- and second-order necessary conditions via exact penalty functions
- An exact penalty approach to constrained minimization problems on metric spaces
- Exactness and algorithm of an objective penalty function
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
- Existence of exact penalty for constrained optimization problems in metric spaces
- A variable structure convex programming based control approach for a class of uncertain linear systems
- Penalty methods for mathematical programming in E^n with general constraint sets
- Convergente rate of a penalty-function scheme
- Numerical computational methods of optimisation in control
- Balance function for the optimal control problem
- Nonlinear programming using minimax techniques
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
- An exact penalty function based on the projection matrix
- A unifying theory of exactness of linear penalty functions
- Direct Methods in the Parametric Moving Boundary Variational Problem
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- Exact penalty in constrained optimization and the Mordukhovich basic subdifferential
- Exact penalty functions in isoperimetric problems
- An external penalty-type method for multicriteria
- THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- An M-objective penalty function algorithm under big penalty parameters
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
- A class of rank-two ellipsoid algorithms for convex programming
- Exact penalty functions and Lagrange multipliers
- Steering exact penalty methods for nonlinear programming
- A second-order smooth penalty function algorithm for constrained optimization problems
- Nonsmooth optimization
- Exact penalty functions and stability in locally Lipschitz programming
- scientific article; zbMATH DE number 3948007 (Why is no real title available?)
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Optimization of electrical circuits
- Exact penalty functions in nonlinear programming
- A smoothing-out technique for min—max optimization
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Necessary and sufficient conditions for a penalty method to be exact
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- On the convergence of a smooth penalty algorithm without computing global solutions
- A first order, exact penalty function algorithm for equality constrained optimization problems
- Statistical inferences for generalized Pareto distribution based on interior penalty function algorithm and bootstrap methods and applications in analyzing stock data
- Exact penalization via dini and hadamard conditional derivatives
- An exact penalty function for nonlinear programming with inequalities
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Particle swarm optimization for preference disaggregation in multicriteria credit scoring problems
- On some generalized equations with metrically \(C\)-increasing mappings: solvability and error bounds with applications to optimization
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- On smoothing $l_1$ exact penalty function for constrained optimization problems
This page was built for publication: Non-Linear Programming Via Penalty Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5557622)