Pages that link to "Item:Q4090135"
From MaRDI portal
The following pages link to Necessary and sufficient conditions for a penalty method to be exact (Q4090135):
Displaying 50 items.
- Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities (Q276332) (← links)
- An exact penalty function based on the projection matrix (Q278572) (← links)
- A distributed continuous time consensus algorithm for maximize social welfare in micro grid (Q325872) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems (Q409835) (← links)
- Second-order analysis of penalty function (Q604260) (← links)
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Decomposition approaches for constrained spatial auction market problems (Q844131) (← links)
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- Image space approach to penalty methods (Q1117841) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- A strong duality theorem for the minimum of a family of convex programs (Q1131953) (← links)
- A minimization method for the sum of a convex function and a continuously differentiable function (Q1134011) (← links)
- A new augmented Lagrangian function for inequality constraints in nonlinear programming problems (Q1148810) (← links)
- A globally convergent algorithm for exact penalty functions (Q1149884) (← links)
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities (Q1172370) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions (Q1199753) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- Piecewise-linear pathways to the optimal solution set in linear programming (Q1357530) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
- Weak sharp solutions for nonsmooth variational inequalities (Q1695815) (← links)
- Solving minimum norm problems using penalty functions and the gradient method (Q1805425) (← links)
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
- Exact barrier function methods for Lipschitz programs (Q1895790) (← links)
- Error forgetting of Bregman iteration (Q1945369) (← links)
- Global minimization of constrained problems with discontinuous penalty functions (Q1962979) (← links)
- A few remarks on penalty and penalty-duality methods in fluid-structure interactions (Q2034415) (← links)
- Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces (Q2045138) (← links)
- Some aspects of nonsmooth variational inequalities on Hadamard manifolds (Q2073011) (← links)
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (Q2203094) (← links)
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
- New simple exact penalty function for constrained minimization (Q2376164) (← links)
- A hierarchical algorithm for vehicle-to-grid integration under line capacity constraints (Q2415115) (← links)
- Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations (Q2492267) (← links)
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design (Q2519532) (← links)
- Smoothed penalty algorithms for optimization of nonlinear models (Q2643624) (← links)
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework (Q2643765) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
- MULTISYMPLECTIC VARIATIONAL INTEGRATORS FOR NONSMOOTH LAGRANGIAN CONTINUUM MECHANICS (Q3178410) (← links)
- Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization (Q3300857) (← links)
- Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization (Q3300858) (← links)
- Exact penalty functions and Lagrange multipliers (Q3360672) (← links)
- Théorie de la pénalisation exacte (Q4712727) (← links)
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation (Q6131454) (← links)
